53 search results - page 3 / 11 » Distributed Symbolic Bounded Property Checking |
ENTCS
2006
13 years 6 months ago
2006
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
FORMATS
2004
Springer
13 years 11 months ago
2004
Springer
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
APN
2008
Springer
13 years 8 months ago
2008
Springer
Model checking is a powerful and widespread technique for the verification of finite distributed systems. However, the main hindrance for wider application of this technique is the...
ATVA
2006
Springer
13 years 10 months ago
2006
Springer
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. Each safety property can be associated with...
ARTS
1999
Springer
13 years 10 months ago
1999
Springer
Model checking can tell us whether a system is correct; probabilistic model checking can also tell us whether a system is timely and reliable. Moreover, probabilistic model checkin...