Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Definability and computability for PRSPDL

Abstract : PRSPDL is a variant of PDL with parallel composition. In the Kripke models in which PRSPDL-formulas are evaluated, states have an internal structure. We devote this paper to the definability issue of several classes of frames by means of the language of PRSPDL and to the computability issue of PRSPDL-validity for various fragments of the PRSPDL-language and for various classes of PRSPDL-frames.
Document type :
Conference papers
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (OATAO) Connect in order to contact the contributor
Submitted on : Tuesday, November 28, 2017 - 12:05:10 PM
Last modification on : Wednesday, July 6, 2022 - 4:09:15 AM


Files produced by the author(s)


  • HAL Id : hal-01650181, version 1


Philippe Balbiani, Tinko Tinchev. Definability and computability for PRSPDL. 10th conference on Advances in Modal logic (AiML 2014), Aug 2014, Groningen, Netherlands. pp.16-33. ⟨hal-01650181⟩



Record views


Files downloads