Skip to Main content Skip to Navigation
Conference papers

Complexity Optimal Decision Procedure for a Propositional Dynamic Logic with Parallel Composition

Joseph Boudou 1
1 IRIT-LILaC - Logique, Interaction, Langue et Calcul
IRIT - Institut de recherche en informatique de Toulouse
Abstract : 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 time, hence that the satisfiability problem of PPDL det is EXPTIME-complete.
Keywords : Decision procedure
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01757357
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Tuesday, April 3, 2018 - 4:28:34 PM
Last modification on : Friday, June 26, 2020 - 3:36:36 AM

File

boudou_18931.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01757357, version 1
  • OATAO : 18931

Citation

Joseph Boudou. Complexity Optimal Decision Procedure for a Propositional Dynamic Logic with Parallel Composition. 8th International Joint Conference on Automated Reasoning (IJCAR 2016), Jun 2016, Coimbra, Portugal. pp. 373-388. ⟨hal-01757357⟩

Share

Metrics

Record views

107

Files downloads

245