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

Sergiu Hart, Micha Sharir

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationAutomata, Languages and Programming - 10th Colloquium
EditorsJosep Diaz
PublisherSpringer Verlag
Pages304-318
Number of pages15
ISBN (Print)9783540123170
DOIs
StatePublished - 1983
Event10th International Colloquium on Automata, Languages and Programming, ICALP 1983 - Barcelona, Spain
Duration: 18 Jul 198322 Jul 1983

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume154 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th International Colloquium on Automata, Languages and Programming, ICALP 1983
Country/TerritorySpain
CityBarcelona
Period18/07/8322/07/83

Fingerprint

Dive into the research topics of 'Concurrent probabilistic program, or: How to schedule if you must'. Together they form a unique fingerprint.

Cite this