138 search results - page 20 / 28 » Model Checking Round-Based Distributed Algorithms |
CONCUR
2010
Springer
14 years 10 months ago
2010
Springer
We are concerned with the availability of systems, defined as the ratio between time of correct functioning and uptime. We propose to model guaranteed availability in terms of regu...
ICDCS
2007
IEEE
15 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...
135
Voted
FMSB
2008
14 years 11 months ago
2008
We introduce bounded asynchrony, a notion of concurrency tailored to the modeling of biological cell-cell interactions. Bounded asynchrony is the result of a scheduler that bounds ...
CONCUR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
CONCUR
1997
Springer
15 years 1 months ago
1997
Springer
Abstract. In a trace-based world, the modular speci cation, veri cation, and control of live systems require each module to be receptive that is, each module must be able to meet i...