57 search results - page 1 / 12 » Improvements in BDD-Based Reachability Analysis of Timed Aut... |
FM
2001
Springer
13 years 9 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...
FORMATS
2009
Springer
13 years 8 months ago
2009
Springer
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
FUIN
2007
13 years 4 months ago
2007
Reachability analysis for timed automata using SAT-based methods was considered in many papers, occurring to be a very efficient model checking technique. In this paper we show ho...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
CAV
2000
Springer
13 years 9 months ago
2000
Springer
We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A con guration of a discrete pushdown timed automa...