====== Talks on Logics ======
In these talks the students present papers on temporal logics (LTL, CTL, CTL*, μ-Calculus, ...).
[[start|Back to Start page]]

----
^Title ^ Authors ^ Reference Papers ^
|On characterization of safety and liveness properties in temporal logic|A.P. Sistla|{{:papers:p39-sistla.pdf|paper}} |
|Recognizing safety and liveness	|B. Alpern and F.B. Schneider	|{{:papers:RecSafeLive.pdf|paper}}|
|Expressibility results for linear-time and branching-time logics	|E.M. Clarke and I.A. Draghicescu	|{{:Papers:clarke.pdf|paper}}|
|Counterexample-preserving reduction for symbolic model checking	|Liu et. al.|{{:Papers:liu.pdf|paper}}|
|The common fragment of CTL and LTL	|M. Maidl	|{{:Papers:maidl.pdf|paper}}|
|Alternating tree automata, parity games, and modal μ-calculus	|T. Wilke	|{{:Papers:wilke.pdf|paper}}|
|Results on the propositional μ-calculus	|D. Kozen	|{{:Papers:kozen83.pdf|paper}}, {{:Papers:kozen-82-mu.pdf|paper}}|
|A finite model theorem for the propositional μ-calculus	|D. Kozen	|{{:Papers:kozen03.pdf|paper}}|
|A proof system for the linear time μ-calculus	|C. Dax, M. Hofmann, and M. Lange	|{{:Papers:dax06.pdf|paper}}|
|Automata and fixed point logic: a coalgebraic perspective	|Y. Venema	|{{:Papers:venema05.pdf|paper}}|
|Axiomatising linear time μ-calculus	|R. Kaivola	|{{:Papers:kaivola95.pdf|paper}}|
|Temporal logic with fixed points	|B. Banieqbal and H. Barringer	|{{:Papers:banieqbal.pdf|paper}}|
|Translating CTL* into the modal μ-calculus	|M. Dam	|{{:Papers:dam90.pdf|paper}}|
|On the universal and existential fragments of the μ-calculus	|T.A. Henziger, O. Kupferman, and R. Majumdar	|{{:Papers:henzinger-mu-Exis-Universal.pdf|paper}}|
|An automata theoretic decision procedure for the propositional μ-calculus	|R.S. Street and E.A. Emerson	|{{:Papers:prop-mu-calculus89.pdf|paper}}|
|A linear translation from CTL* to first-order modal μ-calculus	|S. Cranen, J.F. Groote, and M. Reniers	|{{:Papers:ltl-mu-linear.pdf|paper}}|
|Model checking and the μ-calculus	|E.A. Emerson	|{{:Papers:mc-mu.pdf|paper}}|
|Completeness of Kozen's axionatization for the modal μ-calculus: a simple proof	|K. Tamura|{{:papers:mu-completeness-simple-proof.pdf|paper}}|
|A recursive probabilistic temporal logic|P.F. Castro, C. Kilmurray, and N. Piterman|{{:Papers:recursivePCTL.pdf|paper}}|
|Parametric Linear Dynamic Logic|P. Faymonville and M. Zimmermann|{{:Papers:pldl-fz-2015.pdf|paper}}|
|The Temporal Logic of Actions| Leslie Lamport|{{:Papers:lamport-actions-tplas00.pdf|paper}}|