Paper Info
Title
Timed Automata: Semantics, Algorithms and Tools
Abstract
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.
Year
DOI
Venue
2003
10.1007/978-3-540-27755-2_3
Lecture Notes in Computer Science
Keywords
Field
DocType
data structure
Data structure,Pointer (computer programming),Decision problem,Petri net,Concurrency,Computer science,Automaton,Expert system,Algorithm,Semantics
Conference
Volume
ISSN
Citations 
3098
0302-9743
346
PageRank 
References 
Authors
12.78
40
2
Search Limit
100346
Name
Order
Citations
PageRank
Johan Bengtsson1104860.86
Wang Yi24232332.05