Automata-Theoretic Techniques for Modal Logics of Programs

@article{Vardi1986AutomataTheoreticTF,
  title={Automata-Theoretic Techniques for Modal Logics of Programs},
  author={Moshe Y. Vardi and Pierre Wolper},
  journal={J. Comput. Syst. Sci.},
  year={1986},
  volume={32},
  pages={183-221}
}

The Complementation Problem for Büchi Automata with Applications to Temporal Logic (Extended Abstract)

TLDR
This work uses a construction that involves only an exponential blow-up in the size of the automaton to prove a polynomial space upper bound for the propositional temporal logic of regular events and to prove the complexity hierarchy result for quantified propositionalporal logic.

Alternating Automata: Checking Truth and Validity for Temporal Logics

TLDR
The simple combinatorial structures that emerge from the automata-theoretic approach decouple the logical and algorithmic components of truth and validity checking and yield clean and essentially optimal algorithms for both problems.

Automata-Theoretic Decision Procedures for Information Logics

TLDR
An EXPTIME decision procedure based on the emptiness problem of Buchi automata on infinite trees for the very expressive information logic SIM designed for reasoning about information systems is defined.

Alternating Automata and Program Verification

TLDR
The simple combinatorial structures that emerge from the automata-theoretic approach decouple the logical and algorithmic components of finite-state-program verification and yield clear and general verification algorithms.

Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics

TLDR
The simple combinatorial structures that emerge from the automata-theoretic approach decouple the logical and algorithmic components of truth and validity checking and yield clean and essentially optimal algorithms for both problems.

Reasoning About Infinite Computations

TLDR
This work investigates extensions of temporal logic by connectives defined by finite automata on infinite words and shows that they do not increase the expressive power of the logic or the complexity of the decision problem.

PSPACE Automata for Description Logics

TLDR
The usefulness of segmentable automata is demonstrated by reproving the known PSpace result for satisfiability of ALC concepts with respect to acyclic.

The complexity of tree automata and logics of programs

  • E. EmersonC. Jutla
  • Computer Science
    [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
  • 1988
TLDR
It is shown that for tree automata with m states and n pairs nonemptiness can be tested in time O((mn)/sup 3n/), even though the problem is in general NP-complete, and it follows that satisfiability for propositional dynamic logic with a repetition construct and for the propositional mu-calculus can be tests in deterministic single exponential time.
...

References

SHOWING 1-10 OF 45 REFERENCES

Automata theoretic techniques for modal logics of programs: (Extended abstract)

TLDR
A new technique for obtaining decision procedures for modal logics of programs using a new class of finite automata on infinite trees for which the emptiness problem can be solved in polynomial time.

Propositional Dynamic Logic of Regular Programs

The Emptiness Problem for Automata on Infinite Trees

TLDR
The proof reduces the emptiness problem for automata on infinite trees to that for Automata on finite trees, by showing that any automata definable set of infinite trees must contain a finitely-generable tree.

Models of program logics

  • V. Pratt
  • Computer Science
    20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
  • 1979
TLDR
The common theory has already been shown to be complete in deterministic exponential time; the simpler proof of the upper bound is given.

Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable

Improved upper and lower bounds for modal logics of programs

TLDR
It is shown that the satisfiability problems for Streett's delta-<italic>PDL</italic>.

Propositional Dynamic Logic of Flowcharts

The temporal logic of branching time

TLDR
The following metatheoretical results are proven: 1) an exponential decision procedure for satisfiability; 2) a finite model property; 3) the completeness of an axiomatization.

A Near-Optimal Method for Reasoning about Action

  • V. Pratt
  • Computer Science
    J. Comput. Syst. Sci.
  • 1980