Propositional dynamic logic of looping and converse is elementarily decidable

Cited in

(59)

A Rice-style theorem for parallel automata
Propositional dynamic logic with local assignments
Automata-theoretic techniques for modal logics of programs
Communication in concurrent dynamic logic
Interpreting logics of knowledge in propositional dynamic logic
Uniform inevitability is tree automaton ineffable
An automata theoretic decision procedure for the propositional mu- calculus
A modal logic for cyclic repeating
CTL^* and ECTL^* as fragments of the modal -calculus
A branching time logic with past operators
From bidirectionality to alternation.
Mathematical modal logic: A view of its evolution
On the descriptional complexity of finite automata with modified acceptance conditions
-automata
Automata on infinite trees
Compositional verification of concurrent systems by combining bisimulations
Cartesian difference categories
Program schemata technique for propositional program logics: a 30-year history
Decision procedures and expressiveness in the temporal logic of branching time
Verification of concurrent programs: The automata-theoretic framework
On qualitative route descriptions. Representation, agent models, and computational complexity
Compositional verification of asynchronous concurrent systems using CADP
Model checking transactional memories
Bridging the gap between fair simulation and trace inclusion
Model checking propositional dynamic logic with all extras
An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
Propositional dynamic logic with recursive programs
Index appearance record with preorders
Verification of \(\mathrm{EB}^3\) specifications using CADP
Decidability and expressivity of Ockhamist propositional dynamic logics
Nondeterministic program schemata and their relation to dynamic logic
The mu-calculus and Model Checking
Computation Tree Regular Logic for Genetic Regulatory Networks
From Philosophical to Industrial Logics
Branching-time logics with path relativisation
Dynamic logic with program specifications and its relational proof system
Families of DFAs as acceptors of -regular languages
Linear temporal logic symbolic model checking
A canonical model construction for iteration-free PDL with intersection
Streett Automata Model Checking of Higher-Order Recursion Schemes
Rabin vs. Streett automata
Sharp congruences adequate with temporal logics combining weak and strong modalities
From Monadic Logic to PSL
CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks
2-Exp Time lower bounds for propositional dynamic logics with intersection
A Theory of Bounded Fair Scheduling
Compositional synthesis of control barrier certificates for networks of stochastic systems against \(\omega\)-regular specifications
Temporal logics with language parameters
Compositional verification of concurrent systems by combining bisimulations
Automated temporal reasoning about reactive systems
Controller synthesis against omega-regular specifications: a funnel-based control approach
Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
A unified approach for showing language inclusion and equivalence between various types of -automata
Proof systems for two-way modal -calculus
Gentzen-type axiomatization for PAL
The power of a propositional constant
An essay in combinatory dynamic logic
Determinism and looping in combinatory PDL
Combining partial-order reductions with on-the-fly model-checking.

This page was built for publication: Propositional dynamic logic of looping and converse is elementarily decidable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3662639)