34 search results - page 6 / 7 » Counterexamples for Timed Probabilistic Reachability |
IEICET
2006
14 years 9 months ago
2006
Concurrency is one of the most important issues in system-level design. Interleaving among parallel processes can cause an extremely large number of different behaviors, making de...
COMPSAC
2008
IEEE
15 years 4 months ago
2008
IEEE
This work introduces probabilistic model checking as a viable tool-assisted approach for systematically quantifying DoS security threats. The proposed analysis is based on a proba...
FMICS
2006
Springer
15 years 1 months ago
2006
Springer
Behrmann et al. posed the question whether "To Store or Not To Store" [1] states during reachability analysis, in order to counter the effects of the well-known state spa...
120
click to vote
TSE
2011
14 years 4 months ago
2011
— We propose a new probabilistic temporal logic iLTL which captures properties of systems whose state can be represented by probability mass functions (pmf’s). Using iLTL, we c...
TCS
2002
14 years 9 months ago
2002
We consider the timed automata model of [3], which allows the analysis of realtime systems expressed in terms of quantitative timing constraints. Traditional approaches to real-ti...