Reasoning about The Past with Two-Way Automata
- Computer Science, PhilosophyICALP
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 Local Assignments
- PhilosophyTheor. Comput. Sci.
Propositional dynamic logic with recursive programs
- Computer ScienceJ. Log. Algebraic Methods Program.
An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus
- MathematicsInf. Comput.
The Taming of Converse: Reasoning about Two-way Computations
- Computer ScienceLogic of Programs
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
- Computer Science
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
- Philosophy, Computer ScienceJELIA
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
- Computer Science
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…
SHOWING 1-10 OF 26 REFERENCES
Propositional Dynamic Logic of looping and converse
- PhilosophySTOC '81
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
- Computer Science, PhilosophyJ. Comput. Syst. Sci.
Complete axiomatization of algorithmic properties of program schemes with bounded nondeterministic interpretations
- Computer ScienceSTOC '80
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
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
- Computer Science, MathematicsSWAT
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
- Philosophy19th Annual Symposium on Foundations of Computer Science (sfcs 1978)
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
- Computer Science22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
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.
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…