Propositional dynamic logic of looping and converse is elementarily decidable

Cited In (58)

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

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)