Atomicity of activities

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 84)


Using structured occurrence graphs, we present an operational characterisation of the atomicity of activities. Broadly, activities are defined to occur atomically if they do not interleave with each other. We discuss our characterisation and use it as a starting point for the discussion of implementation issues and the problem of incorporating atomic actions into a concurrent programming language. We finally examine the use of structured occurrence graphs in connection with techniques for error recovery in decentralised systems.


Basic Event Atomic Action Concurrent Programming Error Recovery Basic Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BER78]
    Best, E. and Randell, B.: A Formal of Atomicity in Asynchronous Systems. TR/130, Computing Laboratory, University of Newcastle upon Tyne, December 1978 (submitted for publication).Google Scholar
  2. [BES80a]
    Best, E.: The Relative Strength of K-Density. In this volume.Google Scholar
  3. [BES80b]
    Best, E.: Notes on Predicate Transformers and Concurrent Programs. TR/145, Computing Laboratory, University of Newcastle upon Tyne, to appear in January 1980.Google Scholar
  4. [CHR79]
    Chang, E. and Roberts, R.: An Improved Algorithm for Decentralised Extrema-Finding in Circular Configurations of Processes. CACM 22/5, May 1979, pp. 281–283.Google Scholar
  5. [DEM79]
    DeMillo, R., Lipton, R. and Perlis, A.: Social Processes and the Verification of Computer Programs. CACM 22/5, May 1979.Google Scholar
  6. [DIJ68]
    Dijkstra, E.W.: Co-operating Sequential Processes. In: Programming Languages (ed. F. Genuys), Academic Press, London and New York, 1968.Google Scholar
  7. [DIJ76]
    Dijkstra, E.W.: A Discipline of Programming. Prentice Hall, 1976.Google Scholar
  8. [DIJ78]
    Dijkstra, E.W.: Finding the Correctness Proof of a Concurrent Program. Proc. of the Koninklijke Nederlandse Akademie van Wetenschappen, Amsterdam, Series A, Volume 81(2), June 1978.Google Scholar
  9. [DLM78]
    Dijkstra, E.W., Lamport, L., Martin, A.J., Scholten, C.S. and Steffens, E.F.M.: On-the-Fly Garbage Collection: An Exercise in Co-operation. CACM 21/11, November 1978, pp. 966–975.Google Scholar
  10. [EGL76]
    Eswaran, R., Gray, J., Lorie, R. and Traiger, I.: On the Notions of Consistency and Predicate Locks. CACM 19/11, November 1976, pp. 624–633.Google Scholar
  11. [GES80]
    Genrich, H.J. and Stankiewicz-Wiechno, E.: A Dictionary of Some Basic Notions of Net Theory. In this volume.Google Scholar
  12. [HOA78]
    Hoare, C.A.R.: Communicating Sequential Processes. CACM 21/8, August 1978, pp. 666–677.Google Scholar
  13. [LOM77]
    Lomet, D.: Process Structuring, Synchronisation and Recovery Using Atomic Actions. Proc. of the ACM Conference on Language Design for Reliable Software, Sigplan Notices 12/3, March 1977, pp. 128–137.Google Scholar
  14. [MER77]
    Merlin, P. and Randell, B.: Consistent State Restoration in Distributed Systems. TR/113, Computing Laboratory, University of Newcastle upon Tyne, September 1977 (submitted for publication).Google Scholar
  15. [MER78]
    Merlin, P. and Randell, B.: State Restoration in Distributed Systems. In: FTCS-8, IEEE Toulouse, June 1978, pp. 129–134.Google Scholar
  16. [RAN75]
    Randell, B.: System Structure for Software Fault Tolerance. IEEE Transactions on Software Engineering, SE-1, 2, June 1975, pp. 220–232.Google Scholar
  17. [RLT78]
    Randell, B., Lee, P.A. and Treleaven, P.C.: Reliable Computing Systems. In: Lecture Notes in Computer Science, Vol. 60, Springer Verlag Berlin 1978.Google Scholar
  18. [VLS79]
    Van Lamsweerde, A. and Sintzoff, M.: Formal Derivation of Strongly Correct Concurrent Programs. Acta Information 12, 1979, pp. 1–31.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • E. Best
    • 1
  1. 1.Computing LaboratoryUniversity of Newcastle upon TyneEngland

Personalised recommendations