On Model Checking Durational Kripke Structures (Extended Abstract) - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2002

On Model Checking Durational Kripke Structures (Extended Abstract)

Résumé

We consider quantitative model checking in \emphdurational Kripke structures (Kripke structures where transitions have integer durations) with timed temporal logics where subscripts put quantitative constraints on the time it takes before a property is satisfied. We investigate the conditions that allow polynomial-time model checking algorithms for timed versions of CTL and exhibit an important gap between logics where subscripts of the form "\(= c\)" (exact duration) are allowed, and simpler logics that only allow subscripts of the form "\(≤q c\)" or "\(≥q c\)" (bounded duration).\par A surprising outcome of this study is that it provides the second example of a \(Δ₂^P\)-complete model checking problem.
Fichier principal
Vignette du fichier
LMS-fossacs2002.pdf (197.3 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01194632 , version 1 (07-09-2015)

Identifiants

  • HAL Id : hal-01194632 , version 1

Citer

François Laroussinie, Nicolas Markey, Philippe Schnoebelen. On Model Checking Durational Kripke Structures (Extended Abstract). Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'02), 2002, Grenoble, France. pp.264-279. ⟨hal-01194632⟩
60 Consultations
103 Téléchargements

Partager

Gmail Facebook X LinkedIn More