Communication Dans Un Congrès Année : 2014

Definability and computability for PRSPDL

Résumé

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.

Fichier principal
Vignette du fichier
balbiani_19188.pdf (324.2 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-01650181 , version 1 (28-11-2017)

Licence

Identifiants

  • HAL Id : hal-01650181 , version 1

Citer

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⟩
201 Consultations
195 Téléchargements

Partager

  • More