Model-checking dense-time Duration Calculus

Martin Fränzle
2004 Formal Aspects of Computing  
Since the seminal work of Zhou Chaochen, M. R. Hansen, and P. Sestoft on decidability of Duration Calculus ZHS93 it is well-known 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 key-press veri cation of implementations with respect to elaborate DC speci cations were also impossible, we show that model-checking realistic designs is nevertheless feasible.
more » ... he key issue is that the classical undecidability results rely on a notion of validity o f a formula that refers to a class of models which is considerably richer than the possible behaviours of embedded real-time systems: that of nitely variable trajectories. By analyzing two suitably sparser model classes we obtain model-checking 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.
doi:10.1007/s00165-004-0032-y fatcat:es57mq2pcjhddklygaay4nhl3e