577 search results - page 4 / 116 » Model Checking Based on Simultaneous Reachability Analysis |
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...
FUIN
2007
13 years 5 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...
FTDCS
1997
IEEE
13 years 9 months ago
1997
IEEE
A Software Architecture is the overall structure of a system in terms of its constituent components and their interconnections. In this paper, we describe work to associate behavi...
CONCUR
2005
Springer
13 years 10 months ago
2005
Springer
We introduce two abstract models for multithreaded programs based on dynamic networks of pushdown systems. We address the problem of symbolic reachability analysis for these models...