Sciweavers

50 search results - page 1 / 10
» Model Checking via Reachability Testing for Timed Automata
Sort
View
TACAS
1998
Springer
103views Algorithms» more  TACAS 1998»
14 years 3 months ago
Model Checking via Reachability Testing for Timed Automata
Luca Aceto, Augusto Burgueño, Kim Guldstran...
ATVA
2005
Springer
131views Hardware» more  ATVA 2005»
14 years 4 months ago
An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata
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...
Fuzhi Wang, Marta Z. Kwiatkowska
FUIN
2007
104views more  FUIN 2007»
13 years 10 months ago
SAT-Based Reachability Checking for Timed Automata with Discrete Data
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...
Andrzej Zbrzezny, Agata Pólrola
CONCUR
2004
Springer
14 years 4 months ago
Model Checking Timed Automata with One or Two Clocks
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...
François Laroussinie, Nicolas Markey, Ph. S...
IPL
2007
125views more  IPL 2007»
13 years 10 months ago
State explosion in almost-sure probabilistic reachability
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...
François Laroussinie, Jeremy Sproston