logics
Talks on Logics
In these talks the students present papers on temporal logics (LTL, CTL, CTL*, μ-Calculus, …). Back to Start page
Title | Authors | Reference Papers |
---|---|---|
On characterization of safety and liveness properties in temporal logic | A.P. Sistla | paper |
Recognizing safety and liveness | B. Alpern and F.B. Schneider | paper |
Expressibility results for linear-time and branching-time logics | E.M. Clarke and I.A. Draghicescu | paper |
Counterexample-preserving reduction for symbolic model checking | Liu et. al. | paper |
The common fragment of CTL and LTL | M. Maidl | paper |
Alternating tree automata, parity games, and modal μ-calculus | T. Wilke | paper |
Results on the propositional μ-calculus | D. Kozen | paper, paper |
A finite model theorem for the propositional μ-calculus | D. Kozen | paper |
A proof system for the linear time μ-calculus | C. Dax, M. Hofmann, and M. Lange | paper |
Automata and fixed point logic: a coalgebraic perspective | Y. Venema | paper |
Axiomatising linear time μ-calculus | R. Kaivola | paper |
Temporal logic with fixed points | B. Banieqbal and H. Barringer | paper |
Translating CTL* into the modal μ-calculus | M. Dam | paper |
On the universal and existential fragments of the μ-calculus | T.A. Henziger, O. Kupferman, and R. Majumdar | paper |
An automata theoretic decision procedure for the propositional μ-calculus | R.S. Street and E.A. Emerson | paper |
A linear translation from CTL* to first-order modal μ-calculus | S. Cranen, J.F. Groote, and M. Reniers | paper |
Model checking and the μ-calculus | E.A. Emerson | paper |
Completeness of Kozen's axionatization for the modal μ-calculus: a simple proof | K. Tamura | paper |
A recursive probabilistic temporal logic | P.F. Castro, C. Kilmurray, and N. Piterman | paper |
Parametric Linear Dynamic Logic | P. Faymonville and M. Zimmermann | paper |
The Temporal Logic of Actions | Leslie Lamport | paper |
logics.txt · Last modified: 2017/04/18 10:32 by 127.0.0.1