On the abstract specification and formal analysis of synchronization properties of concurrent systems

  • M. W. Shields
  • P. E. Lauer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 75)


Critical Section Mutual Exclusion Concurrent System Firing Sequence Form Path 
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. [Courtois, Georges 77]
    Courtois, P.J., Georges, J.: On Starvation Prevention, R.A.I.R.D. Informatique/Computer Science, Vol. 11, No. 2, 1977.Google Scholar
  2. [Devillers 77]
    Devillers, R.: Non starving solutions to the dining philosophers problem. ASM/30, University of Newcastle upon Tyne, 1977.Google Scholar
  3. [Devillers, Lauer 77]
    Devillers, R., Lauer, P.E.: A general mechanism for the local control of starvation: application to the dining philosophers and to the reader-writer problem. ASM/32, University of Newcastle upon Tyne, 1977.Google Scholar
  4. [Holt 71]
    Holt, A.: Introduction to Occurrence Systems, Associate Information Techniques, Ed. Jacks, E.L., American Elsevier Publ. Co. Inc., New York (1971), pp.175–203.Google Scholar
  5. [Knuth 78]
    Knuth, E.: Petri Nets and regular Trace languages. ASM/47, University of Newcastle upon Tyne, April, 1978.Google Scholar
  6. [Lauer, Campbell 75]
    Lauer, P.E., Campbell R.H.: Formal semantics for a class of high-level primitives for co-ordinating concurrent processes, Acta Informatica, 5, pp.297–332, 1975.Google Scholar
  7. [Lauer, Shields 77]
    Lauer, P.E., Shields, M.W.: Abstract specification of resource accessing disciplines: adequacy, starvation, priority and interrupts. Tech. Rep. 120, University of Newcastle upon Tyne. Also in Proc. of a Workshop on Global Descriptive Methods for Synchronization in Real-Time Applications, AFCET, Paris, Nov. 3–4, 1977.Google Scholar
  8. [Lauer, Shields, Best 78]
    Lauer, P.E., Shields, M.W., Best E.: On the design and certification of asynchronous systems of process: Part 1: COSY — a system specification language based on paths and processes, ASM/49. Part 2: formal theory of the basic COSY notation. ASM/45, University of Newcastle upon Tyne, 1978.Google Scholar
  9. [Lauer, Torrigiani 78]
    Lauer, P.E., Torrigiani, R.R.: Towards a system specification language based on paths and processes. Tech. Rep. 117, University of Newcastle upon Tyne, Feb. 1978.Google Scholar
  10. [Mazurkiewicz 77]
    Mazurkiewicz, A.W.: Concurrent program schemes and their interpretation. Presented at the Århus Workshop on verification of parallel processes. Århus, Denmark. June 13–14, 1977.Google Scholar
  11. [Petri 76]
    Petri, C.A.: Nicht sequentiele prozesse. ISF Report 76-6, G.M.D., Bonn, 1976.Google Scholar
  12. [Shields 77]
    Shields, M.W.: A simple spooling system described using the path notation together with a proof of its adequacy. ASM/38, University of Newcastle upon Tyne, 1977.Google Scholar
  13. [Winkowski 77]
    Winkowski, J.: Algebras of arrays, a tool to deal with concurrency. Institute of Computer Science, Polish Academy of Science, Warsaw, 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • M. W. Shields
    • 1
  • P. E. Lauer
    • 1
  1. 1.The University of Newcastle upon Tyne Computing LaboratoryUSA

Personalised recommendations