Design and analysis of highly parallel and distributed systems

  • P. E. Lauer
  • M. W. Shields
  • E. Best
Parallellism & Non-Determinism
Part of the Lecture Notes in Computer Science book series (LNCS, volume 86)


State Machine Regular Expression Basic Notation Input Place Firing Sequence 
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. [CG77]
    Courtois, P.J. and Georges, J.: On starvation prevention, R.A.I.R.O. Informatique/Computer Science (Vol. 11, No. 2, 1977, p.127–141)Google Scholar
  2. [De77]
    Devillers, R.: Non starving solutions to the dining philosophers problem, ASM/30, Computing Lab., University of Newcastle upon Tyne, 1977.Google Scholar
  3. [DL77]
    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, Computing Lab., University of Newcastle upon Tyne, 1977.Google Scholar
  4. [DLT79]
    Devillers, R.; Lauer, P.E.; Torrigiani, P.R.: A distributed banker. Tech. Report Series, Université Libre de Bruxelles, Brussels, April 1979.Google Scholar
  5. [Ge71]
    Genrich, J.J.: Einfache nicht-sequentielle Prozesse. St. Augustin: Gesellschaft für Mathematik und Datenverarbeitung Bonn, Bericht Nr. 37 (1971).Google Scholar
  6. [Ha74]
    Hack,M.: Extended State-Machine Allocatable Nets (ESMA), and extension of Free Petri Net results. MIT Computation Structures Group, Memo 78–1, June 1974.Google Scholar
  7. [HC70]
    Holt, A.W. and Commoner, P.: Events and conditions. Applied Data Research, New York, 1970.Google Scholar
  8. [Ho68]
    Holt, A.W.: Information system theory project, Tech. Rep. RADC-TR-68-305; Applied Data Research Inc., 1968.Google Scholar
  9. [LBS77]
    Lauer, P.E.; Best, E.; Shields, M.W.: On the problem of achieving adequacy of concurrent programs. Tech. Report 103, University of Newcastle upon Tyne, 1977. Also in Proc. of a Working Conference on Formal Description of Programming Concepts, 1977, North Holland.Google Scholar
  10. [LC75]
    Lauer, P.E.; Campbell, R.H.: Formal semantics for a class of high level primitives for co-ordinating concurrent processes. pp.247–332, Acta Informatica 5, 1975.Google Scholar
  11. [LS77]
    Lauer, P.E.; Shields, M.W.: Abstract specification of resource accessing disciplines: adequacy, starvation, priority and interrupts. Tech. Report 117, University of Newcastle upon Tyne. Also in SIGPLAN Notices Vol. 13 No. 12 and Proc. of a Workshop on Global Description Methods for Synchronisation in Real-time Applications, AFCET, Paris, Nov. 3–4, 1977.Google Scholar
  12. [LSB78]
    Lauer, P.E.; Shields, M.W.; Best, E.: Formal Theory of the basic COSY notation. ASM/45. Also to appear as a Tech. Report. Computing Laboratory, University of Newcastle upon Tyne, 1978.Google Scholar
  13. [LTD79]
    Lauer, P.E.; Torrigiani, P.R.; Devillers, R.E.: The hyperfast Banker. ASM/55, Computing Laboratory, Univ. of Newcastle upon Tyne, 29th Jan. 1979.Google Scholar
  14. [LTS78]
    Lauer, P.E.; Torrigiani, P.R.; Shields, M.W.: COSY: a system specification language based on paths and processes. Tech. Report Series, TR 136, Computing Laboratory, Univ. of Newcastle upon Tyne, April 1979. To appear in Acta Informatica 1979.Google Scholar
  15. [Maz77]
    Mazurkiewicz, A.: Concurrent program schemes and their interpretation. Presented at the Arhus Workshop on Verification of Parallel Processes. June 13–24, 1977, Arhus, Denmark.Google Scholar
  16. [S79]
    Shields, M.W.: Adequate path expressions. Tech. Report 141, Computing Laboratory, University of Newcastle upon Tyne. Also to appear in Proceedings, International Symposium: Semantics of concurrent computation, Evian-les-Bains, France, July 2–4, 1979, Springer Verlag.Google Scholar
  17. [SL78]
    Shields, M.W.; Lauer, P.E.: On the abstract specification and formal analysis of synchronization properties of concurrent systems. Tech. Report 125, University of Newcastle upon Tyne, Computing Laboratory. Also in proceedings of Int. Conf. on Mathematical Studies of Information Processing, Aug. 23–26, 1978, RIMS, Kyoto, Japan.Google Scholar
  18. [SL79]
    Shields, M.W.; Lauer, P.E.: A formal semantics for concurrent systems. 6 International Colloquium for Automata, Languages and Programming, July 16–21, 1979, Graz, Austria. Springer Lecture Notes, Springer Verlag, 1979.Google Scholar
  19. [TL77]
    Torrigiani, P.R.; Lauer, P.E.: An object oriented notation for path expression. AICA 1977, Annual Conference, 3rd Vol. Software Methodologies, pp.349–371, 12–14 October 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • P. E. Lauer
    • 1
  • M. W. Shields
    • 1
  • E. Best
    • 1
  1. 1.Computing LaboratoryUniversity of Newcastle upon TyneNewcastle upon Tyne

Personalised recommendations