Resource separation in dynamic logic of propositional assignments

DOI10.1016/j.jlamp.2021.100683OpenAlexW3157123045MaRDI QIDQ5918351

Nicolas Troquard, Andreas Herzig, Joseph Boudou

Publication date: 3 August 2021

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://oatao.univ-toulouse.fr/26298/1/boudou_26298.pdf

zbMATH Keywords

dynamic logicconcurrencyseparation logicparallel compositionpropositional assignments

Mathematics Subject Classification ID

Computer science (68-XX)

Uses Software

• Graphplan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic epistemic logic
• Parallel action: Concurrent dynamic logic with independent modalities
• The complexity of PDL with interleaving
• Fast planning through planning graph analysis
• CONCUR 2004 -- concurrency theory. 15th international conference, London, UK, August 31 -- September 3, 2004. Proceedings.
• Complexity Optimal Decision Procedure for a Propositional Dynamic Logic with Parallel Composition
• A Simple Separation Logic
• PDL with intersection of programs: a complete axiomatization
• Concurrent dynamic logic
• Iteration-free PDL with storing, recovering and parallel composition: a complete axiomatization
• Judgment aggregation in dynamic logic of propositional assignments
• A Dynamic Logic Account of Active Integrity Constraints
• Propositional Dynamic Logic with Storing, Recovering and Parallel Composition
• Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL
• CONCUR 2004 - Concurrency Theory
• Resource separation in dynamic logic of propositional assignments

This page was built for publication: Resource separation in dynamic logic of propositional assignments