A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Complexity Optimal Decision Procedure for a Propositional Dynamic Logic with Parallel Composition
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
PPDL det extends propositional dynamic logic (PDL) with parallel composition of programs. This new construct has separation semantics: to execute the parallel program (α || β) the initial state is separated into two substates and the programs α and β are executed on these substates. By adapting the elimination of Hintikka sets procedure, we provide a decision procedure for the satisfiability problem of PPDL det . We prove that this decision procedure can be executed in deterministic exponential
doi:10.1007/978-3-319-40229-1_26
fatcat:funi23ybnvbeblb6vothos2444