Propositional dynamic logic of looping and converse is elementarily decidable

Cited in

(59)

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