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).
Swipe to navigate through the chapters of this book
- Symbolic Model Checking for Simply-Timed Systems
- Springer Berlin Heidelberg
- Sequence number
Neuer Inhalt/© ITandMEDIA