Concurrent Probabilistic Programs, Or: How to Schedule If You Must
- 1 November 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 14 (4) , 991-1012
- https://doi.org/10.1137/0214070
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Verification of Probabilistic ProgramsSIAM Journal on Computing, 1984
- Termination of Probabilistic Concurrent ProgramACM Transactions on Programming Languages and Systems, 1983
- N-Process mutual exclusion with bounded waiting by 4 · Log2 N-valued shared variableJournal of Computer and System Sciences, 1982
- The choice coordination problemActa Informatica, 1982
- Impartiality, justice and fairness: The ethics of concurrent terminationPublished by Springer Nature ,1981