Fair termination for parameterized probabilistic concurrent systems
<p>We consider the problem of automatically verifying that a parameterized family of probabilistic concurrent systems terminates with probability one for all instances against adversarial schedulers. A parameterized family defines an infinite-state system: for each number n, the family consist...
| Main Authors: | , , , |
|---|---|
| Format: | Conference item |
| Published: |
Springer
2016
|