CAV
13 years 9 months ago
2001 Springer 
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
CAV
13 years 10 months ago
2001 Springer
In formal verification, we verify that a system is correct with respect to a specification. When verification succeeds and the system is proven to be correct, there is still a q...
CAV
13 years 10 months ago
2001 Springer 
Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time properties, a model checker produces a counterexample comput...
CAV
13 years 10 months ago
2001 Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
CAV
13 years 10 months ago
2001 Springer |
Hardware