321 search results - page 1 / 65 » Symbolic Model Checking for Probabilistic Timed Automata |
FORMATS
2004
Springer
13 years 10 months ago
2004
Springer
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
ATVA
2005
Springer
13 years 10 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...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...
IPL
2007
13 years 4 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...
ICTAC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...