Summary
We propose a generalisation of occurrence graphs as a formal model of computational structure. The model is used to define the “atomic occurrence” of a program, to characterise “interference freeness” between programs, and to model error recovery in a decentralised system.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Best, E.: Proof of a current program finding Euler paths. In: Proceedings of the MFCS'80. Lecture Notes in Computer Science, Vol. 88. Berlin Heidelberg New York: Springer 1980
Dijkstra, E.W.: Finding the correctness proof of a concurrent program. Proceedings of the Koninklijke Nederlandse Akademie van Wetenschappen, Series A, Vol. 81(2), 1978
Dijkstra, E.W., Lamport, L., Martin, A.J., Scholten, C.S., Steffens, E.F.M.: On-the-fly garbage collection: an exercise in cooperation. CACM 21, 966–975 (1978)
Eswaran, R., Gray, J., Lorie, R., Traiger, I.: On the notions of consistency and predicate locks. CACM 19, 624–633 (1976)
Floyd, R.W.: Assigning meanings to programs. Applied Mathematics, Vol. 19, Providence: AMS 1967
Genrich, H.J., Stankiewicz-Wiechno, E.: A dictionary of some basic notions of net theory. Proceedings of the Advanced Course on General Net Theory. Lecture Notes in Computer Science, Vol. 84, pp. 519–531. Berlin Heidelberg New York: Springer 1980
Gray, J.N.: Notes on data base operating systems. In: Operating systems. Lecture Notes in Computer Science, Vol.60, pp. 394–481. Berlin Heidelberg New York: Springer 1978
Holt, A.W.: Final Report of the project on information systems theory. Applied Data Research ADR5606, and USAF — Rome Air Development Centre, RADC-TR-68-305, 1968
Lampson, B.W., Sturgis, H.: Crash recovery in a distributed data storage system. Xerox PARC Report, 1978; CACM (in press, 1981)
Handbook of mathematical logic (J. Barwise, ed.). Amsterdam: North Holland (1977)
Lomet, D.: Process structuring, synchronisation and recovery using atomic actions. Proceedings of the ACM Conference on language design for reliable software. Sigplan Notices 12, 128–137 (1977)
Manna, Z.: Mathematical theory of computation. New York: McGraw Hill 1974
McDermid, J.A.: Checkpointing and recovery in distributed systems. Second International Conference on distributed computing systems. IEEE Computer Society Press, pp 271–282 (1981)
Merlin, P., Randell, B.: State restoration in distributed systems. In: FTCS-8, IEEE Toulouse, pp. 129–137, 1978
Ore, O.: Theory of graphs. American Mathematical Society, Colloquium Publ. Vol. XXXVIII, Rhode Island, 1962
Owicki, S., Lamport, L.: Proving liveness properties of concurrent programs. Op. 57, Stanford University/SRI, 1980
Randell, B.: System structure for software fault tolerance. IEEE Trans. Software Engrg. SE-1, 220–232 (1975)
Randell, B., Lee, P.A., Treleaven, P.C.: Reliable computing systems. In: Operating systems. Lecture Notes in Computer Science, Vol. 60, pp. 282–391. Berlin Heidelberg New York: Springer 1978
Rothine, J.B., Bernstein, P.A., Fox, S., Goodman, N., Hammer, M., Landers, T.A., Reeve, C., Shipman, D.W., Wong, E.: Introduction to a system for distributed databases (SDD-1). ACM Transactions on Database Systems 5, 1–17 (1980)
Silberschatz, A., Kedem, Z.: Consistency in a hierarchical database system. JACM, 27, 72–80 (1980)
Wood, W.G.: Recovery control of communicating process in a distributed system. TR/158, Computing Laboratory, University of Newcastle upon Tyne, November 1980
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Best, E., Randell, B. A formal model of atomicity in asynchronous systems. Acta Informatica 16, 93–124 (1981). https://doi.org/10.1007/BF00289593
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00289593