TY - JOUR
T1 - Timed automata
T2 - Semantics, algorithms and tools
AU - Bengtsson, Johan
AU - Yi, Wang
PY - 2004
Y1 - 2004
N2 - 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 verification tools for timed systems. As an example, we give a brief introduction to the tool UPPAAL.
AB - 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 verification tools for timed systems. As an example, we give a brief introduction to the tool UPPAAL.
UR - https://www.scopus.com/pages/publications/35048861846
U2 - 10.1007/978-3-540-27755-2_3
DO - 10.1007/978-3-540-27755-2_3
M3 - 文章
AN - SCOPUS:35048861846
SN - 0302-9743
VL - 3098
SP - 87
EP - 124
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
ER -