17 search results - page 3 / 4 » Binary Reachability Analysis of Discrete Pushdown Timed Auto... |
FUIN
2007
13 years 6 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...
ICRA
2007
IEEE
14 years 14 days ago
2007
IEEE
— This paper extends the notion of residuals for fault detection, well known in the continuous system to the timed discrete events systems. The aim is to design the fault indicat...
CONCUR
2000
Springer
13 years 9 months ago
2000
Springer
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
HYBRID
1999
Springer
13 years 10 months ago
1999
Springer
Abstract. One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed...
TCS
2002
13 years 5 months ago
2002
We consider the timed automata model of [3], which allows the analysis of realtime systems expressed in terms of quantitative timing constraints. Traditional approaches to real-ti...