Reasoning about The Past with Two-Way Automata
@inproceedings{Vardi1998ReasoningAT, title={Reasoning about The Past with Two-Way Automata}, author={Moshe Y. Vardi}, booktitle={ICALP}, year={1998} }
The Μ-calculus can be viewed as essentially the “ultimate” program logic, as it expressively subsumes all propositional program logics, including dynamic logics, process logics, and temporal logics. It is known that the satisfiability problem for the Μ-calculus is EXPTIME-complete. This upper bound, however, is known for a version of the logic that has only forward modalities, which express weakest preconditions, but not backward modalities, which express strongest postconditions. Our main… CONTINUE READING
Topics from this paper
400 Citations
Automata-Theoretic Decision Procedures for Information Logics
- Mathematics, Computer Science
- Fundam. Informaticae
- 2002
- 10
Temporal logics for concurrent recursive programs: Satisfiability and model checking
- Mathematics, Computer Science
- J. Appl. Log.
- 2014
- 5
Reasoning in Expressive Description Logics with Fixpoints based on Automata on Infinite Trees
- Mathematics, Computer Science
- IJCAI
- 1999
- 125
- PDF
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking
- Mathematics, Computer Science
- MFCS
- 2011
- 18
- PDF
Branching-Time Logics Repeatedly Referring to States
- Mathematics, Computer Science
- J. Log. Lang. Inf.
- 2009
- 12
References
SHOWING 1-10 OF 84 REFERENCES
Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable
- Mathematics, Computer Science
- Inf. Control.
- 1982
- 222
- PDF
The complexity of tree automata and logics of programs
- Mathematics, Computer Science
- [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
- 1988
- 288
Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics
- Mathematics, Computer Science
- CADE
- 1997
- 48
Once and for all [temporal logic]
- Mathematics, Computer Science
- Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science
- 1995
- 12
- PDF
Modalities for Model Checking: Branching Time Logic Strikes Back
- Computer Science
- Sci. Comput. Program.
- 1987
- 346
Propositional Dynamic Logic of Regular Programs
- Mathematics, Computer Science
- J. Comput. Syst. Sci.
- 1979
- 1,284
- PDF
An automata-theoretic approach to branching-time model checking
- Mathematics, Computer Science
- JACM
- 2000
- 638
- PDF