Resource separation in dynamic logic of propositional assignments
Résumé
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...