Timed Automata: Semantics, Algorithms and Tools

This chapter is to provide a tutorial and pointers to results and related work on timed automata with a focus on semantical and algorithmic aspects of verification tools. We present the concrete and abstract semantics of timed automata (based on transition rules, regions and zones), decision problems, and algorithms for verification. A detailed description on DBM (Difference Bound Matrices) is included, which is the central data structure behind several verifica

• Type: Conference
• Year: 2003
• Where: AC
• Authors: Johan Bengtsson, Wang Yi
• Keywords: AC 2003, Central Data Structure, Difference Bound Matrices, Software Engineering, Timed Automata