Concurrent Probabilistic Programs, Or: How to Schedule If You Must

DOI10.1137/0214070MaRDI QIDQ3686020zbMATH OpenOpenAlexFDO

Authors Sergiu Hart, Micha Sharir

Publication date 1985

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0214070

zbMATH Keywords

concurrent probabilistic programfairnessMarkov chainsprogram terminationscheduler

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Recommendations

• On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
• Probabilistic verification
• Probabilistic termination versus fair termination
• scientific article; zbMATH DE number 3982496
• Model checking concurrent programs with nondeterminism and randomization

Cited in

(13)

• On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
• Probabilistic verification
• Probabilistic termination versus fair termination
• Enumeration and random generation of concurrent computations
• On probabilistic parallel programs with process creation and synchronisation
• Communicating processes, scheduling, and the complexity of nontermination
• Undecidability results for distributed probabilistic systems
• A probabilistic analysis of multiprocessor list scheduling: the erlang case
• scientific article; zbMATH DE number 3982496 (Why is no real title available?)
• scientific article; zbMATH DE number 125889 (Why is no real title available?)
• Linear Structures for Concurrency in Probabilistic Programming Languages
• scientific article; zbMATH DE number 7147446 (Why is no real title available?)
• Delay-bounded scheduling

This page was built for publication: Concurrent Probabilistic Programs, Or: How to Schedule If You Must

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686020)