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.
Domaines
Logique en informatique [cs.LO]Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...