Efficient Timed Model Checking for Discrete-Time Systems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2006

Efficient Timed Model Checking for Discrete-Time Systems

Résumé

We consider model checking of timed temporal formulae in \emphdurational transition graphs (DTGs), \emphi.e., Kripke structures where transitions have integer durations. Two semantics for DTGs are presented and motivated. We consider timed versions of CTL where subscripts put quantitative constraints on the time it takes before a property is satisfied. \par We 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 Without exact durations, model checking can be done in polynomial time, but with exact durations, it becomes \(Δ_2^P\)-complete or PSPACE-complete depending on the considered semantics.
Fichier principal
Vignette du fichier
LMS-TCS05.pdf (355.79 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

Citer

François Laroussinie, Nicolas Markey, Philippe Schnoebelen. Efficient Timed Model Checking for Discrete-Time Systems. Theoretical Computer Science, 2006, 353 (1-3), pp.249-271. ⟨10.1016/j.tcs.2005.11.020⟩. ⟨hal-01194608⟩
53 Consultations
69 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More