Liveness of Randomised Parameterised Systems under Arbitrary Schedulers
We consider the problem of verifying liveness for systems with a finite, but unbounded, number of processes, commonly known as parameterised systems. Typical examples of such systems include distributed protocols (e.g. for the dining philosopher problem). Unlike the case of verifying safety, proving...
| Main Authors: | , |
|---|---|
| 格式: | Conference item |
| 出版: |
Springer
2016
|