Abstract
Given a finite set of concurrent processes executing asynchronously, such that each process may use randomization in its course of execution, we consider the problem of computing the worst-case probability for the program which consists of these processes to terminate (i.e, to converge to a specified set of common goal states), under a fair interleaving scheduling of the processes. Several methods for computing this probability are presented, and characterizations of the special case in which this probability is 1 are derived. Specializations of these characterizations to the case of deterministic and nondeterministic programs are also discussed.
| Original language | English |
|---|---|
| Title of host publication | Automata, Languages and Programming - 10th Colloquium |
| Editors | Josep Diaz |
| Publisher | Springer Verlag |
| Pages | 304-318 |
| Number of pages | 15 |
| ISBN (Print) | 9783540123170 |
| DOIs | |
| State | Published - 1983 |
| Externally published | Yes |
| Event | 10th International Colloquium on Automata, Languages and Programming, ICALP 1983 - Barcelona, Spain Duration: 18 Jul 1983 → 22 Jul 1983 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 154 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 10th International Colloquium on Automata, Languages and Programming, ICALP 1983 |
|---|---|
| Country/Territory | Spain |
| City | Barcelona |
| Period | 18/07/83 → 22/07/83 |
Bibliographical note
Publisher Copyright:© 1983, Springer-Verlag.