34 search results - page 2 / 7 » Reachability results for timed automata with unbounded data ... |
FM
2001
Springer
13 years 12 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
CAV
2003
Springer
13 years 11 months ago
2003
Springer
Thispapergivesashort overviewofa model checking tool forreal-time systems. The modeling language are timed automata extended with concepts for modular modeling. The tool provides r...
CSL
2009
Springer
14 years 1 months ago
2009
Springer
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
VMCAI
2010
Springer
14 years 4 months ago
2010
Springer
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
MST
2006
13 years 7 months ago
2006
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...