A superimposition control construct for distributed systems
- 1 April 1993
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 15 (2), 337-356
- https://doi.org/10.1145/169701.169682
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Interleaving set temporal logicTheoretical Computer Science, 1990
- Script: A communication abstraction mechanism and its verificationScience of Computer Programming, 1986
- An example of stepwise refinement of distributed programs: quiescence detectionACM Transactions on Programming Languages and Systems, 1986
- Distributed snapshotsACM Transactions on Computer Systems, 1985
- Termination detection for distributed computationsInformation Processing Letters, 1984
- Guardians and Actions: Linguistic Support for Robust, Distributed ProgramsACM Transactions on Programming Languages and Systems, 1983
- Distributed deadlock detectionACM Transactions on Computer Systems, 1983
- Decomposition of distributed programs into communication-closed layersScience of Computer Programming, 1982
- Termination detection for diffusing computationsInformation Processing Letters, 1980
- Distributed TerminationACM Transactions on Programming Languages and Systems, 1980