Complexity optimal decision procedure for a propositional dynamic logic with parallel composition

DOI10.1007/978-3-319-40229-1_26MaRDI QIDQ2817938zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Exponential-size model property for PDL with separating parallel composition
• scientific article; zbMATH DE number 4068839
• Decision complexity of variants of propositional dynamic logic
• Tableaux methods for propositional dynamic logics with separating parallel composition
• A practical decision method for propositional dynamic logic (preliminary report)

Cites work

• 2-Exp Time lower bounds for propositional dynamic logics with intersection
• A Modal Logic for Chopping Intervals
• A semantics for concurrent separation logic
• A simple separation logic
• Concurrent dynamic logic
• Decidable and undecidable logics with a binary modality
• Dynamic epistemic logic
• Exponential-size model property for PDL with separating parallel composition
• scientific article; zbMATH DE number 993777 (Why is no real title available?)
• scientific article; zbMATH DE number 1801371 (Why is no real title available?)
• scientific article; zbMATH DE number 3843130 (Why is no real title available?)
• scientific article; zbMATH DE number 67503 (Why is no real title available?)
• scientific article; zbMATH DE number 3624763 (Why is no real title available?)
• scientific article; zbMATH DE number 2081098 (Why is no real title available?)
• scientific article; zbMATH DE number 6863850 (Why is no real title available?)
• Model checking propositional dynamic logic with all extras
• Nondeterministic phase semantics and the undecidability of Boolean BI
• Propositional dynamic logic of regular programs
• Propositional dynamic logic with storing, recovering and parallel composition
• Resources, concurrency, and local reasoning
• Separation logics and modalities: a survey
• Tableaux methods for propositional dynamic logics with separating parallel composition
• The complexity of PDL with interleaving
• The semantics and proof theory of the logic of bunched implications

Cited in

(10)

• Parallel action: Concurrent dynamic logic with independent modalities
• Bisimilar and logically equivalent programs in PDL with parallel operator
• Exponential-size model property for PDL with separating parallel composition
• scientific article; zbMATH DE number 5599076 (Why is no real title available?)
• Tableaux methods for propositional dynamic logics with separating parallel composition
• scientific article; zbMATH DE number 4068839 (Why is no real title available?)
• Decision complexity of variants of propositional dynamic logic
• scientific article; zbMATH DE number 1507246 (Why is no real title available?)
• Resource separation in dynamic logic of propositional assignments
• Resource separation in dynamic logic of propositional assignments

This page was built for publication: Complexity optimal decision procedure for a propositional dynamic logic with parallel composition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817938)