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.

翻译：我们通过在分离逻辑的启发下增加一个平行构成的操作员来扩展提议分配的动态逻辑。 我们通过减少轴心,从而确立可衰减性,提供了一种异同化。 我们还证明模式检查的复杂性和可相对性问题在PSPACE中都存在。