Complexity Optimal Decision Procedure for a Propositional Dynamic Logic with Parallel Composition

DOI10.1007/978-3-319-40229-1_26zbMath1475.68075OpenAlexW2487215098MaRDI QIDQ2817938

Joseph Boudou

Publication date: 5 September 2016

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: http://oatao.univ-toulouse.fr/18931/1/boudou_18931.pdf

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Bisimilar and logically equivalent programs in PDL with parallel operator ⋮ Resource separation in dynamic logic of propositional assignments

Cites Work

• A semantics for concurrent separation logic
• Resources, concurrency, and local reasoning
• Dynamic epistemic logic
• Propositional dynamic logic of regular programs
• The complexity of PDL with interleaving
• Decidable and undecidable logics with a binary modality
• The semantics and proof theory of the logic of bunched implications
• Model checking propositional dynamic logic with all extras
• A Simple Separation Logic
• Exponential-Size Model Property for PDL with Separating Parallel Composition
• Nondeterministic Phase Semantics and the Undecidability of Boolean BI
• Tableaux Methods for Propositional Dynamic Logics with Separating Parallel Composition
• Concurrent dynamic logic
• A Modal Logic for Chopping Intervals
• Separation logics and modalities: a survey
• Propositional Dynamic Logic with Storing, Recovering and Parallel Composition
• 2-Exp Time lower bounds for propositional dynamic logics with intersection
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity Optimal Decision Procedure for a Propositional Dynamic Logic with Parallel Composition