@inproceedings{9a4d12a8e3cf4f0a845bbba32b877586,

title = "Concurrent probabilistic program, or: How to schedule if you must",

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.",

author = "Sergiu Hart and Micha Sharir",

note = "Publisher Copyright: {\textcopyright} 1983, Springer-Verlag.; null ; Conference date: 18-07-1983 Through 22-07-1983",

year = "1983",

doi = "10.1007/BFb0036917",

language = "אנגלית",

isbn = "9783540123170",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "304--318",

editor = "Josep Diaz",

booktitle = "Automata, Languages and Programming - 10th Colloquium",

}