Propositional dynamic logic of regular programs
From MaRDI portal
Cites work
- A practical decision method for propositional dynamic logic (preliminary report)
- An axiomatic basis for computer programming
- Consistent and complementary formal theories of the semantics of programming languages
- Guarded commands, nondeterminacy and formal derivation of programs
- scientific article; zbMATH DE number 3461480 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 3564294 (Why is no real title available?)
- scientific article; zbMATH DE number 3299715 (Why is no real title available?)
- scientific article; zbMATH DE number 3315203 (Why is no real title available?)
- On static logics, dynamic logics, and complexity classes
- Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Theory of program structures: Schemes, semantics, verification
Cited in
(only showing first 100 items - show all)- On the proof theory of the modal mu-calculus
- On combinations of propositional dynamic logic and doxastic modal logics
- Polyadic dynamic logics for HPSG parsing
- A multiprocess network logic with temporal and spatial modalities
- Process logic with regular formulas
- Propositional dynamic logic with local assignments
- A probabilistic PDL
- PDL with data constants
- The semantics of Hoare's iteration rule
- A logic to reason about likelihood
- Automata-theoretic techniques for modal logics of programs
- Concurrent program schemes and their logics
- Communication in concurrent dynamic logic
- Interpreting logics of knowledge in propositional dynamic logic
- Succinct representation of regular sets using gotos and Boolean variables
- Alternating multihead finite automata
- A finite model theorem for the propositional \(\mu\)-calculus
- An arithmetical hierarchy in propositional dynamic logic
- An automata theoretic decision procedure for the propositional mu- calculus
- An elementary proof of the completeness of PDL
- Propositional dynamic logic is weaker without tests
- Process logic: Expressiveness, decidability, completeness
- On the computational complexity of satisfiability in propositional logics of programs
- TABLEAUX: A general theorem prover for modal logics
- On models for propositional dynamic logic
- Dynamic algebras: Examples, constructions, applications
- A model checker for linear time temporal logic
- A guide to completeness and complexity for modal logics of knowledge and belief
- Getting started: Beginnings in the logic of action
- Dynamic linear time temporal logic
- Computation paths logic: An expressive, yet elementary, process logic
- \(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs
- A modal perspective on the computational complexity of attribute value grammar
- CTL^* and ECTL^* as fragments of the modal -calculus
- Complexity results for two-way and multi-pebble automata and their logics
- The complexity of PDL with interleaving
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability
- Modeling belief in dynamic systems. I: Foundations
- Program schemata vs. automata for decidability of program logics
- A polynomial space construction of tree-like models for logics with local chains of modal connectives
- Complexity of some problems in positive and related calculi
- Mathematical modal logic: A view of its evolution
- Symbolic model checking for -calculus requires exponential time
- EXPtime tableaux for ALC
- On the completeness of propositional Hoare logic
- The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs
- Finite-trace linear temporal logic: coinductive completeness
- On the complexity of input/output logic
- Deriving the correctness of quantum protocols in the probabilistic logic for quantum programs
- Interactions between knowledge, action and commitment within agent dynamic logic
- About cut elimination for logics of common knowledge
- Towards reasoning about Petri nets: a propositional dynamic logic based approach
- A linear-time model-checking algorithm for the alternation-free modal mu- calculus
- The price of universality
- Domino-tiling games
- Deterministic propositional dynamic logic: finite models, complexity, and completeness
- Combining deduction and model checking into tableaux and algorithms for converse-PDL.
- Module checking
- Tarskian set constraints
- On the structural simplicity of machines and languages
- The complexity of identifying characteristic formulae
- Almost event-rate independent monitoring
- Producing explanations for rich logics
- The compound interest in relaxing punctuality
- Computational complexity for bounded distributive lattices with negation
- Dynamic preference logic meets iterated belief change: representation results and postulates characterization
- Inquisitive propositional dynamic logic
- Event-based time-stamped claim logic
- Temporal logic with recursion
- NP reasoning in the monotone \(\mu\)-calculus
- A semantics and a logic for \textit{Fuzzy Arden Syntax}
- Dynamic Łukasiewicz logic and its application to immune system
- The satisfiability problem for a quantitative fragment of PCTL
- Adding proof calculi to epistemic logics with structured knowledge
- Compositional verification of concurrent systems by combining bisimulations
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation
- Propositional dynamic logic with quantification over regular computation sequences
- A modal view on resource-bounded propositional logics
- A formalism to specify unambiguous instructions inspired by Mīmāṁsā in computational settings
- Cartesian difference categories
- Dynamic Łukasiewicz logic and dynamic MV-algebras
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
- Free Kleene algebras with domain
- Program schemata technique for propositional program logics: a 30-year history
- Temporal logics with language parameters
- Strategies, model checking and branching-time properties in Maude
- Answering regular path queries in expressive description logics via alternating tree-automata
- Decision procedures and expressiveness in the temporal logic of branching time
- Two AGM-style characterizations of model repair
- ExpTime tableaux with global caching for hybrid PDL
- Deontology of compound actions
- Complexity of the universal theory of modal algebras
- The model checking fingerprints of CTL operators
- Alternating-time temporal logic ATL with finitely bounded semantics
- On qualitative route descriptions. Representation, agent models, and computational complexity
- Compositional verification of asynchronous concurrent systems using CADP
- A goal-directed decision procedure for hybrid PDL
- Bisimilar and logically equivalent programs in PDL with parallel operator
- On the universal and existential fragments of the \(\mu\)-calculus
- Sequent calculi for branching time temporal logics of knowledge and beliefwith awareness: completeness and decidability
This page was built for publication: Propositional dynamic logic of regular programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1258296)
