2661 search results - page 41 / 533 » Model Checking Performability Properties |
CHARME
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Unbounded model checking of invariant properties is typically solved using symbolic reachability. However, BDD based reachability methods suffer from lack of robustness ...
SBMF
2010
Springer
13 years 3 months ago
2010
Springer
Designers of concurrent and distributed algorithms usually express them using pseudo-code. In contrast, most verification techniques are based on more mathematically-oriented forma...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
Liveness properties in concurrent systems are, informally, those properties that stipulate that something good eventually happens during execution. In order to prove that a given ...
TACAS
2007
Springer
14 years 2 months ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
ICDCS
2007
IEEE
14 years 3 months ago
2007
IEEE
Security and reliability of network protocol implementations are essential for communication services. Most of the approaches for verifying security and reliability, such as forma...