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

Sergiu Hart; Micha Sharir

doi:10.1007/BFb0036917

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

Sergiu Hart, Micha Sharir

School of Computer Science

Tel Aviv University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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	https://doi.org/10.1007/BFb0036917
State	Published - 1983
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

Funding

Funders	Funder number
Courant Institute
Tel-Avi~ University
Office of Naval Research	N00014-75-C-0571

Access to Document

10.1007/BFb0036917

Cite this

Hart, S., & Sharir, M. (1983). Concurrent probabilistic program, or: How to schedule if you must. In J. Diaz (Ed.), Automata, Languages and Programming - 10th Colloquium (pp. 304-318). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 154 LNCS). Springer Verlag. https://doi.org/10.1007/BFb0036917

@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.; 10th International Colloquium on Automata, Languages and Programming, ICALP 1983 ; 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",

}

Hart, S & Sharir, M 1983, Concurrent probabilistic program, or: How to schedule if you must. in J Diaz (ed.), Automata, Languages and Programming - 10th Colloquium. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 154 LNCS, Springer Verlag, pp. 304-318, 10th International Colloquium on Automata, Languages and Programming, ICALP 1983, Barcelona, Spain, 18/07/83. https://doi.org/10.1007/BFb0036917

Concurrent probabilistic program, or: How to schedule if you must. / Hart, Sergiu; Sharir, Micha.
Automata, Languages and Programming - 10th Colloquium. ed. / Josep Diaz. Springer Verlag, 1983. p. 304-318 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 154 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Concurrent probabilistic program, or

T2 - 10th International Colloquium on Automata, Languages and Programming, ICALP 1983

AU - Hart, Sergiu

AU - Sharir, Micha

PY - 1983

Y1 - 1983

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0020985945&partnerID=8YFLogxK

U2 - 10.1007/BFb0036917

DO - 10.1007/BFb0036917

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0020985945

SN - 9783540123170

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 304

EP - 318

BT - Automata, Languages and Programming - 10th Colloquium

A2 - Diaz, Josep

PB - Springer Verlag

Y2 - 18 July 1983 through 22 July 1983

ER -

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

Abstract

Publication series

Conference

Funding

Access to Document

Other files and links

Fingerprint

Cite this