Efficient timed model checking for discrete-time systems

We consider model checking of timed temporal formulae in durational transition graphs (DTGs), i.e., Kripke structures where transitions have integer durations. Two semantics for DTGs are presented and motivated. We consider timed versions of where subscripts put quantitative constraints on the time it takes before a property is satisfied.We exhibit an important gap between logics where subscripts of the form “” (exact duration) are allowed, and simpler logics that only allow subscripts of the form “” or “” (bounded duration).Without exact durations, model checking can be done in polynomial time, but with exact durations, it becomes -complete or PSPACE-complete depending on the considered semantics.