2000 character limit reached
Resource separation in dynamic logic of propositional assignments (2104.14884v1)
Published 30 Apr 2021 in cs.LO
Abstract: 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.