Resource separation in dynamic logic of propositional assignments

We extend dynamic logic of propositional assignments by adding an operator of parallel composition that is inspired by separation logics. We provide an axiomatisation via reduction axioms, thereby establishing decidability. We also prove that the complexity of both the model checking and the satisfiability problem stay in PSPACE.

[1]  Andreas Herzig,et al.  Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[2]  François Schwarzentruber,et al.  A Succinct Language for Dynamic Epistemic Logic , 2017, AAMAS.

[3]  Andreas Herzig,et al.  Judgment Aggregation in Dynamic Logic of Propositional Assignments , 2016 .

[4]  Joseph Boudou.  Complexity Optimal Decision Procedure for a Propositional Dynamic Logic with Parallel Composition , 2016, IJCAR.

[5]  Peter W. O'Hearn,et al.  Concurrent separation logic , 2016, SIGL.

[6]  Christoph Scheben,et al.  Information Flow Analysis , 2016, Deductive Software Verification.

[7]  Andreas Herzig,et al.  A Simple Separation Logic , 2013, WoLLIC.

[8]  Peter W. O'Hearn,et al.  Resources, Concurrency and Local Reasoning , 2004, CONCUR.

[9]  Mario R. F. Benevides,et al.  Propositional Dynamic Logic with Storing, Recovering and Parallel Composition , 2011, LSFA.

[10]  Martin C. Cooper,et al.  A Simple Account of Multi-Agent Epistemic Planning , 2016, ECAI.

[11]  Joseph Boudou,et al.  Resource Separation in Dynamic Logic of Propositional Assignments , 2019, DaLí.

[12]  Andreas Herzig,et al.  On the revision of planning tasks , 2014, ECAI.

[13]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[14]  Robert Goldblatt,et al.  Parallel action: Concurrent dynamic logic with independent modalities , 1992, Stud Logica.

[15]  John C. Reynolds,et al.  Separation logic: a logic for shared mutable data structures , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[16]  Philippe Balbiani,et al.  Definability and Computability for PRSPDL , 2014, Advances in Modal Logic.

[17]  David Peleg,et al.  Concurrent dynamic logic , 1987, JACM.

[18]  Joseph Boudou,et al.  Iteration-free PDL with storing, recovering and parallel composition: a complete axiomatization , 2018, J. Log. Comput..

[19]  François Schwarzentruber,et al.  Arbitrary Public Announcement Logic with Mental Programs , 2015, AAMAS.

[20]  Jelle Gerbrandy,et al.  Dynamic epistemic logic , 1998 .

[21]  Andreas Herzig,et al.  A Dynamic Logic Account of Active Integrity Constraints , 2019, Fundam. Informaticae.

[22]  Reiner Hähnle,et al.  A Theorem Proving Approach to Analysis of Secure Information Flow , 2005, SPC.

[23]  Andreas Herzig,et al.  Dynamic logic of parallel propositional assignments and its applications to planning , 2019, IJCAI.

[24]  Andreas Herzig,et al.  Belief Change Operations: A Short History of Nearly Everything, Told in Dynamic Logic of Propositional Assignments , 2014, KR.

[25]  Stephen D. Brookes,et al.  A Semantics for Concurrent Separation Logic , 2004, CONCUR.

[26]  Alain J. Mayer,et al.  The Complexity of PDL with Interleaving , 1996, Theor. Comput. Sci..

[27]  Dimiter Vakarelov,et al.  PDL with intersection of programs: a complete axiomatization , 2003, J. Appl. Non Class. Logics.