50 search results - page 1 / 10 » Model Checking via Reachability Testing for Timed Automata |
TACAS
1998
Springer
14 years 3 months ago
1998
Springer
ATVA
2005
Springer
14 years 4 months ago
2005
Springer
Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for...
FUIN
2007
13 years 10 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...
CONCUR
2004
Springer
14 years 4 months ago
2004
Springer
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
IPL
2007
13 years 10 months ago
2007
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...