Skip to main content

The core concurrency

  • Computer Architecture, Concurrency, Parallelism, Communication And Networking
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 468))

Abstract

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.

(Revised Version)

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Best, E., COSY: Its relation to Nets and to CSP, LNCS 225, 1986

    Google Scholar 

  2. Hoare, C.A.R: Communicating Sequential Processes, Prentice Hall, 1985

    Google Scholar 

  3. 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. Janicki, R.: Nets, Sequential Components and Concurrency Relations, TCS 29, 1984. pp. 87–121.

    Google Scholar 

  5. Janicki, R., Müldner, T.: On Algebraic Transformations of Sequential Specifications, AMAST, Iowa City, May 22–24, 1989

    Google Scholar 

  6. 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. Lauer, P. E. et al.: COSY: a System Specification Language Based on Path Expressions, Acta Informatica 12, 1979

    Google Scholar 

  8. Lauer, P. E. et al.: Design and Analysis of Highly Parallel and Distributed Systems, LNCS 86, 1980

    Google Scholar 

  9. Mazurkiewicz, A.: Trace Theory, LNCS 255, pp. 297–324

    Google Scholar 

  10. Milner, R.: A Complete Axiomatization for Observatoinal Congruence of Finite-State Behaviours, Inf. and Computing, 81, 1989), no.2

    Google Scholar 

  11. Milner, R.: A Complete Inference System for a Class of Regular Behaviors, Report CSR-111-82, Dept. of Comp. Sci., Univ. of Edinburgh, 1982

    Google Scholar 

  12. Milner, R.: A Calculus for Communicating Systems, LNCS 92, 1980

    Google Scholar 

  13. Peterson, J.L. Petri Net Theory and the Modeling of Systems. Prentice Hall 1981.

    Google Scholar 

  14. Proszynski, P.W.: Concurrency: Free Choice vs. Synchronization, in Computing and Information, North-Holland 1989, pp 213–219.

    Google Scholar 

  15. Reisig, W.: Petri Nets, Springer-Verlag, 1985.

    Google Scholar 

  16. M.W. Shields. Adequate Path Expressions. Lecture Notes in Comp.Sci. 70, Springer 1979.

    Google Scholar 

  17. Soborg, Ole: Transforming COSY into ASCCS, M.Sc. Thesis, Aalborg Univ., 1986

    Google Scholar 

  18. Zielonka, W.: Notes on Finite Asynchronous Automata. Theoretical Informatics and Applications, vol. 21, no. 2, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

S. G. Akl F. Fiala W. W. Koczkodaj

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Proszynski, P.W. (1991). The core concurrency. In: Akl, S.G., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '90. ICCI 1990. Lecture Notes in Computer Science, vol 468. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53504-7_91

Download citation

  • DOI: https://doi.org/10.1007/3-540-53504-7_91

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53504-1

  • Online ISBN: 978-3-540-46677-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics