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

中文翻译：

---

命题分配动态逻辑中的资源分离

通过添加由分离逻辑启发的并行合成算符，我们扩展了命题分配的动态逻辑。我们通过减少公理提供公理化，从而建立可判定性。我们还证明，模型检查和可满足性问题的复杂性都保留在PSPACE中。