321 search results - page 16 / 65 » Symbolic Model Checking for Probabilistic Timed Automata |
ENTCS
2002
13 years 8 months ago
2002
FORMATS
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with re...
CAV
2004
Springer
14 years 15 days ago
2004
Springer
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
CONCUR
1997
Springer
14 years 27 days ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
ARTS
1999
Springer
14 years 1 months ago
1999
Springer
In this paper we study the issue of progress for distributed timed systems modeled as the parallel composition of timed automata. We clarify the requirements of discrete progress (...