The core concurrency

  • Piotr W. Proszynski
Computer Architecture, Concurrency, Parallelism, Communication And Networking
Part of the Lecture Notes in Computer Science book series (LNCS, volume 468)


The paper presents a unique net semantics of regular and concurrent regular expressions. The resulting nets are 1-save, unlabelled nets with silent actions. We argue that in this way a highly structural and independent from concurrent context representation of systems can be obtained. Interestingly enough, nonsequential representation of sequential behaviours has been found to be an alternative for symbolic representation.


Concurrency Nonsequential systems COSY nets 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bes86]
    Best, E., COSY: Its relation to Nets and to CSP, LNCS 225, 1986Google Scholar
  2. [Hoa85]
    Hoare, C.A.R: Communicating Sequential Processes, Prentice Hall, 1985Google Scholar
  3. [JLKD85]
    R. Janicki, P.E. Lauer, M. Koutny, and R.Devillers. Concurrent and Maximally Concurrent Evolution of Non-Sequential Systems. Theoretical Comp. Science 43 (1985).Google Scholar
  4. [Jan84]
    Janicki, R.: Nets, Sequential Components and Concurrency Relations, TCS 29, 1984. pp. 87–121.Google Scholar
  5. [JM89]
    Janicki, R., Müldner, T.: On Algebraic Transformations of Sequential Specifications, AMAST, Iowa City, May 22–24, 1989Google Scholar
  6. [Lau75]
    Lauer, P. E. and R.H. Campbell: Formal Semantics of a Class of High-Level Primitives for Coordinating Concurrent Processes. Acta Informatica 5, (1975) pp. 297–332.Google Scholar
  7. [Lau79]
    Lauer, P. E. et al.: COSY: a System Specification Language Based on Path Expressions, Acta Informatica 12, 1979Google Scholar
  8. [Lau80]
    Lauer, P. E. et al.: Design and Analysis of Highly Parallel and Distributed Systems, LNCS 86, 1980Google Scholar
  9. [Maz86]
    Mazurkiewicz, A.: Trace Theory, LNCS 255, pp. 297–324Google Scholar
  10. [Mil89]
    Milner, R.: A Complete Axiomatization for Observatoinal Congruence of Finite-State Behaviours, Inf. and Computing, 81, 1989), no.2Google Scholar
  11. [Mil82]
    Milner, R.: A Complete Inference System for a Class of Regular Behaviors, Report CSR-111-82, Dept. of Comp. Sci., Univ. of Edinburgh, 1982Google Scholar
  12. [Mil80]
    Milner, R.: A Calculus for Communicating Systems, LNCS 92, 1980Google Scholar
  13. [Pet81]
    Peterson, J.L. Petri Net Theory and the Modeling of Systems. Prentice Hall 1981.Google Scholar
  14. [Pro89]
    Proszynski, P.W.: Concurrency: Free Choice vs. Synchronization, in Computing and Information, North-Holland 1989, pp 213–219.Google Scholar
  15. [Rei85]
    Reisig, W.: Petri Nets, Springer-Verlag, 1985.Google Scholar
  16. [Shi79]
    M.W. Shields. Adequate Path Expressions. Lecture Notes in Comp.Sci. 70, Springer 1979.Google Scholar
  17. [Sob86]
    Soborg, Ole: Transforming COSY into ASCCS, M.Sc. Thesis, Aalborg Univ., 1986Google Scholar
  18. [Zie87]
    Zielonka, W.: Notes on Finite Asynchronous Automata. Theoretical Informatics and Applications, vol. 21, no. 2, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Piotr W. Proszynski
    • 1
  1. 1.Jodrey School of Computer ScienceAcadia UniversityWolfvilleCanada

Personalised recommendations