Verification of multiprocess probabilistic protocols
- 1 March 1986
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 1 (1) , 53-72
- https://doi.org/10.1007/bf01843570
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Symmetric and economical solutions to the mutual exclusion problem in a distributed systemTheoretical Computer Science, 1984
- Termination of Probabilistic Concurrent ProgramACM Transactions on Programming Languages and Systems, 1983
- On the extremely fair treatment of probabilistic algorithmsPublished by Association for Computing Machinery (ACM) ,1983
- How to cook a temporal proof system for your pet languagePublished by Association for Computing Machinery (ACM) ,1983
- Proving Liveness Properties of Concurrent ProgramsACM Transactions on Programming Languages and Systems, 1982
- The choice coordination problemActa Informatica, 1982
- Reasoning with time and chanceInformation and Control, 1982
- Verification of Concurrent Programs. Part II. Temporal Proof Principles.Published by Defense Technical Information Center (DTIC) ,1981
- On the andvantages of free choicePublished by Association for Computing Machinery (ACM) ,1981
- Hierarchical Ordering of Sequential ProcessesPublished by Springer Nature ,1971