Propositional dynamic logic of regular programs
From MaRDI portal
Cites work
- 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?)
- 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
- 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)- Propositional dynamic logic with quantification over regular computation sequences
- THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆
- Complexity results for multi-pebble automata and their logics
- scientific article; zbMATH DE number 2156365 (Why is no real title available?)
- Parametrised complexity of satisfiability in temporal logic
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
- The complexity of identifying characteristic formulae
- On complexity of verification of interacting agents' behavior
- A semantics and a logic for \textit{Fuzzy Arden Syntax}
- Quantified coalition logic of knowledge, belief and certainty
- Satisfiability for SCULPT-schemas for CSV-like data
- Propositional Dynamic Logic for Hyperproperties
- Branching-time logics and fairness, revisited
- A multiprocess network logic with temporal and spatial modalities
- Visibly linear temporal logic
- The expressive power of implicit specifications
- Gentzen-type axiomatization for PAL
- On the complexity of input/output logic
- Existential second-order logic and modal logic with quantified accessibility relations
- A calculus for automatic verification of Petri nets based on resolution and dynamic logics
- An elementary proof of the completeness of PDL
- Alternating automata: unifying truth and validity checking for temporal logics
- A note on an extension of PDL
- Complexity of the universal theory of modal algebras
- Program schemata vs. automata for decidability of program logics
- Program schemata technique for propositional program logics: a 30-year history
- Path constraints in semistructured data
- A logic to reason about likelihood
- Tableaux and algorithms for Propositional Dynamic Logic with Converse
- Dynamic modal logic with counting: when reduction axioms work and fail
- Concurrent program schemes and their logics
- Interpreting logics of knowledge in propositional dynamic logic
- Succinct representation of regular sets using gotos and Boolean variables
- A proof system for finite trees
- Automated temporal reasoning about reactive systems
- scientific article; zbMATH DE number 7561609 (Why is no real title available?)
- A poor man's epistemic logic based on propositional assignment and higher-order observation
- A polynomial space construction of tree-like models for logics with local chains of modal connectives
- Symbolic model checking for -calculus requires exponential time
- Deterministic propositional dynamic logic: finite models, complexity, and completeness
- On the Decision Problem for Two-Variable First-Order Logic
- Exploring non-regular extensions of propositional dynamic logic with description-logics features
- Alternating-time stream logic for multi-agent systems
- An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications
- Complexity of some problems in positive and related calculi
- On the universal and existential fragments of the \(\mu\)-calculus
- Regular decision processes
- Dynamic Łukasiewicz logic and its application to immune system
- Compositional verification of concurrent systems by combining bisimulations
- Alternating-time temporal logic ATL with finitely bounded semantics
- CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks
- Temporal stream logic modulo theories
- A Decidable Multi-agent Logic for Reasoning About Actions, Instruments, and Norms
- Complete Axiomatization of a Relative Modal Logic with Composition and Intersection
- Propositional Dynamic Logic for Message-Passing Systems
- Deciding expressive description logics in the framework of resolution
- Action models in inquisitive logic
- REASONING ABOUT TRANSFINITE SEQUENCES
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability
- A new proof of completeness for a relative modal logic with composition and intersection
- Dynamic linear time temporal logic
- Propositional dynamic logic of context-free programs and fixpoint logic with chop
- The propositional dynamic logic of deterministic, well-structured programs
- PDL with negation of atomic programs
- Deciding Equations in the Time Warp Algebra
- A dynamic logic with branching modalities
- Bisimilar and logically equivalent programs in PDL
- Extending propositional dynamic logic for Petri nets
- Bounded situation calculus action theories
- An on-the-fly tableau-based decision procedure for PDL-satisfiability
- Constructive Formalization of Hybrid Logic with Eventualities
- Description Logics
- Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski
- Complexity analysis of propositional concurrent programs using domino tiling
- Almost event-rate independent monitoring
- PDL with intersection and converse: satisfiability and infinite-state model checking
- Propositional dynamic logic for searching games with errors
- Reasoning on UML class diagrams
- Exponential-size model property for PDL with separating parallel composition
- Semantics of looping programs in Propositional Dynamic Logic
- Complexity optimal decision procedure for a propositional dynamic logic with parallel composition
- Tableaux methods for propositional dynamic logics with separating parallel composition
- Completeness and decidability results for CTL in constructive type theory
- Deriving the correctness of quantum protocols in the probabilistic logic for quantum programs
- Domino-tiling games
- Getting started: Beginnings in the logic of action
- Logic of visibility in social networks
- Module checking
- The compound interest in relaxing punctuality
- PDL for ordered trees
- An arithmetical hierarchy in propositional dynamic logic
- Propositional dynamic logic is weaker without tests
- A uniform method for proving lower bounds on the computational complexity of logical theories
- An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning
- An operational domain-theoretic treatment of recursive types
- Formal verification of multi-agent systems behaviour emerging from cognitive task analysis
- The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions
- To be announced
- Computation paths logic: an expressive, yet elementary, process logic
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)
