Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable

@article{Streett1982PropositionalDL,
  title={Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable},
  author={Robert S. Streett},
  journal={Inf. Control.},
  year={1982},
  volume={54},
  pages={121-141}
}

Propositional Dynamic Logic of Flowcharts

Reasoning about The Past with Two-Way Automata

TLDR
The main result in this paper is an exponential time upper bound for the satisfiability problem of the Μ-calculus with both forward and backward modalities, developed a theory of two-way alternating automata on infinite trees.

Propositional dynamic logic with recursive programs

The Taming of Converse: Reasoning about Two-way Computations

TLDR
This work investigates the interaction of converse with two constructs that deal with infinite computations: loop and repeat, and shows that converse - loop - PDL is decidable in exponential time, and converse- repeat -PDL isDecidable in nondeterministic exponential time.

The Taming of Converse: Reasoning about Two-Way Computations

TLDR
This work investigates the interaction of converse with two constructs that deal with infinite computations: loop and repeat, and shows that converse-loop-PDL is decidable in exponential time, andconverse-repeat-PDD is decidablc in nondeterministic exponential time.

Decidability and Expressivity of Ockhamist Propositional Dynamic Logics

TLDR
This paper presents two variants of OPDL, a logic unifying the family of dynamic logics and thefamily of branching-time temporal logics, and provides a 2EXPTIME decision procedure for the satisfiability problem of each variant.

Games with Second-order Quantiiers Which Decide Propositional Program Logics

The paper demonstrates how second-order quantiication and nite games can be exploited for deciding complicated propositional program logics like the propositional-Calculus with converse (C ?). This
...

References

SHOWING 1-10 OF 26 REFERENCES

Propositional Dynamic Logic of looping and converse

Propositional Dynamic Logic can be extended to include both an infinitary iteration construct delta and a backtracking construct converse. The resulting logic does not satisfy the finite model

Propositional Dynamic Logic of Regular Programs

Complete axiomatization of algorithmic properties of program schemes with bounded nondeterministic interpretations

TLDR
It is proved that the semantical and the syntactical consequence operations coincide (completeness property) and that the model existence theorem holds.

The Completeness of Propositional Dynamic Logic

TLDR
The completeness of a rather natural set of axioms for this logic is proved and an extension of it obtained by allowing the inverse operation which converts a program into its inverse.

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.

A decidability result for a second order process logic

  • R. Parikh
  • Philosophy
    19th Annual Symposium on Foundations of Computer Science (sfcs 1978)
  • 1978
TLDR
The decidability of the validity problem for a rather general language for talking about computations is proved and some decidable results of Pratt, Constable, Fischer-Ladner, and Pnueli are obtained.

A decidable mu-calculus: Preliminary report

  • V. Pratt
  • Computer Science
    22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
  • 1981
TLDR
This work provides an intimate link between PDL as defined by the Segerberg axioms and the mu-calculi of de Bakker and Park and shows that its satisfiability problem is decidable in exponential time.

Results on the Propositional mu-Calculus

  • D. Kozen
  • Mathematics
    Theor. Comput. Sci.
  • 1983

Decidability of second-order theories and automata on infinite trees

Introduction. In this paper we solve the decision problem of a certain secondorder mathematical theory and apply it to obtain a large number of decidability results. The method of solution involves

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.