Results 1 
1 of
1
ModelChecking DenseTime Duration Calculus
, 1998
"... Since the seminal work of Zhou Chaochen, M. R. Hansen, and P. Sestoft on decidability of Duration Calculus [ZHS93] it is wellknown that decidable fragments of Duration Calculus can only be obtained through withdrawal of much of the interesting vocabulary of this logic. While this was formerly taken ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Since the seminal work of Zhou Chaochen, M. R. Hansen, and P. Sestoft on decidability of Duration Calculus [ZHS93] it is wellknown that decidable fragments of Duration Calculus can only be obtained through withdrawal of much of the interesting vocabulary of this logic. While this was formerly taken as an indication that keypress verification of implementations with respect to elaborate DC specifications were also impossible, we show that modelchecking realistic designs is nevertheless feasible. The key issue is that the classical undecidability results rely on a notion of validity of a formula that refers to a class of models which is considerably richer than the possible behaviours of embedded realtime systems: that of finitely variable trajectories. By analyzing two suitably sparser model classes we obtain modelchecking procedures for rich subsets of Duration Calculus. Together with undecidability results also obtained, this sheds light upon the exact borderline between decidability and undecidability of Duration Calculi and related logics.