30 search results - page 1 / 6 » Efficient on-the-fly Algorithm for Checking Alternating Time... |
QEST
2006
IEEE
13 years 11 months ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
FORMATS
2009
Springer
13 years 8 months ago
2009
Springer
Abstract In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. We define timed weak ...
DSRT
2004
IEEE
13 years 8 months ago
2004
IEEE
Distributed simulation cloning technology is designed to analyze alternative scenarios of a distributed simulation concurrently within the same execution session. The goal is to o...
QEST
2010
IEEE
13 years 2 months ago
2010
IEEE
Discrete-Time Markov Chains (DTMCs) are a widely-used formalism to model probabilistic systems. On the one hand, available tools like PRISM or MRMC offer efficient model checking a...
ARTS
1997
Springer
13 years 8 months ago
1997
Springer
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the ...