A method for developing concurrent systems

  • Ryszard Janicki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 167)


Generalize Path Regular Expression Single Path Concurrent System Communicate Sequential Process 
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. [CHP71]
    Courtois P.J., Heymans F., Parnas D.L., Concurrent Control with "Readers" and "Writers", CACM 14, 10(1971), 667–668.Google Scholar
  2. [H80]
    Hoare C.A.R., Communicating Sequential Processes, In: R.M. McKeag and A.M. Macnaghten (Eds) "On the Construction of Programs", Cambridge University Press, Cambridge 1980.Google Scholar
  3. [J79]
    Janicki R., A Characterisation of Concurrency-like Relations, Lecture Notes in Computer Science 70, Springer 1979, 320–333.Google Scholar
  4. [J81]
    Janicki R., On the Design of Concurrent Systems, Proc. of the 2nd Conf. on Distributed Computing Systems, Paris 1981, IEEE Press, New York 1981.Google Scholar
  5. [J81a]
    Janicki R., A Construction of Concurrent Schemes by Means of Sequential Solution and Concurrency Relations, Lecture Notes in Computer Science 107, Springer 1981, 327–334.Google Scholar
  6. [J82]
    Janicki R., Nets, Sequential Components and Concurrency Relations, Report ASM/92, Comp. Lab., Univ. of Newcastle upon Tyne, 1982, also Theoretical Computer Science, vol. 29, 1984, to appear.Google Scholar
  7. [J82a]
    Janicki R., Transforming Sequential Systems into Concurrent Systems, Report ASM/93, Computing Laboratory, Univ. of Newcastle upon Tyne, 1982.Google Scholar
  8. [L82]
    Lauer P.E., Synchronization of Concurrent Processes without Globality Assumptions, In: K.G. Beauchamp (Ed) "New Advances in Distributed Computer Systems", NATO Advanced Study Institute Series, D. Reidel Publ. Company, 1982, 341–366.Google Scholar
  9. [LC75]
    Lauer P.E., Campbell R.H., Formal Semantics for a Class of High Level Primitives for Coordinating Concurrent Processes, Acta Informatica 5(1975), 247–322.CrossRefGoogle Scholar
  10. [LS78]
    Lauer P.E., Shields M.W., Abstract specification of resource accessing disciplines: adequacy, starvation, priority and interrupts, SIGPLAN Notices 13, 12(1978), 41–58.Google Scholar
  11. [LSB79]
    Lauer P.E., Shields M.W., Best E., Formal Theory of the Basic COSY Notation, Technical Report 143, Comp. Lab., University of Newcastle upon Tyne, 1979.Google Scholar
  12. [LSC81]
    Lauer P.E., Shields M.W., Cotronis J.Y., Formal behavioural specification of concurrent systems without globality assumptions, Lecture Notes in Computer Science 107, Springer 1981, 115–151.Google Scholar
  13. [M77]
    Mazurkiewicz A., Concurrent Program Schemes and Their Interpretations, DAIMI PB-78, Aarhus University Press, 1977.Google Scholar
  14. [P71]
    Patil S.S., Limitations and Capabilities of Dijkstra's Semaphore Primitives for Co-ordination among Processes, Project MAC, Computation Structures Group Memo 57, 1971.Google Scholar
  15. [S79]
    Shields M.W., Adequate Path Expressions, Lecture Notes in Computer Science 70, Springer 1979, 249–265.Google Scholar
  16. [S80]
    Shields M.W., Is COSY big enough? Notes Towards a Study of Deterministic Concurrent Machines, Report ASM/77, Comp. Lab., Univ. of Newcastle upon Tyne, 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Ryszard Janicki
    • 1
    • 2
  1. 1.Institute of Electronic SystemsAalborg University CentreAalborgDenmark
  2. 2.Institute of MathematicsWarsaw Technical UniversityWarszawaPoland

Personalised recommendations