Symbolic Model Checking for Simply-Timed Systems

Nicolas Markey (1) , Philippe Schnoebelen (1)

1 LSV - Laboratoire Spécification et Vérification [Cachan]

We describe OBDD-based symbolic model checking algorithms for simply-timed systems, i.e. finite state graphs where transitions carry a duration. These durations can be arbitrary natural numbers. A simple and natural semantics for these systems opens the way for improved efficiency. Our algorithms have been implemented in NuSMV and perform well in practice (on standard case studies).

Domaines: Logique en informatique [cs.LO]

Nicolas Markey, Philippe Schnoebelen. Symbolic Model Checking for Simply-Timed Systems. Proceedings of the Joint Conferences Formal Modelling and Analysis of Timed Systems (FORMATS'04) and Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT'04), 2004, Grenoble, France. pp.102-117. ⟨hal-01194620⟩