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}
}
  • Moshe Y. Vardi
  • Published in ICALP 1998
  • Computer Science
  • 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
    400 Citations
    The Hybrid µ-Calculus
    • 102
    • PDF
    Automata-Theoretic Decision Procedures for Information Logics
    • 10
    Hybrid Branching-Time Logics
    • V. Weber
    • Mathematics, Computer Science
    • ArXiv
    • 2007
    • 5
    • PDF
    The Complexity of Enriched µ-Calculi
    • 55
    • PDF
    Branching-Time Logics Repeatedly Referring to States
    • V. Weber
    • Mathematics, Computer Science
    • J. Log. Lang. Inf.
    • 2009
    • 12
    Bounded-Variable Fragments of Hybrid Logics
    • 20
    The Expressive Power of Epistemic $μ$-Calculus
    • 6
    • PDF

    References

    SHOWING 1-10 OF 84 REFERENCES
    Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable
    • 222
    • PDF
    Propositional Dynamic Logic of looping and converse
    • 197
    The complexity of tree automata and logics of programs
    • E. Emerson, C. Jutla
    • Mathematics, Computer Science
    • [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
    • 1988
    • 288
    Once and for all [temporal logic]
    • O. Kupferman, A. Pnueli
    • 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
    • 346
    Propositional Dynamic Logic of Regular Programs
    • 1,284
    • PDF
    On Model-Checking for Fragments of µ-Calculus
    • 305
    • PDF
    An automata-theoretic approach to branching-time model checking
    • 638
    • PDF