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 axiomatization via reduction axioms, thereby establishing decidability. We also prove that the complexity of both the model checking and the satisfi...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 121; p. 100683
Main Authors Boudou, Joseph, Herzig, Andreas, Troquard, Nicolas
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.06.2021
Elsevier
Subjects
Artificial Intelligence
Computer Science
Concurrency
Discrete Mathematics
Dynamic logic
Logic
Mathematics
Parallel composition
Propositional assignments
Separation logic
Symbolic Computation
Separation logic
Parallel composition
Dynamic logic
Propositional assignments
Concurrency
propositional assignments
separation logic
parallel composition
concurrency
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2352-2208
DOI:10.1016/j.jlamp.2021.100683