Skip to main content
SpringerLink
Log in
Book cover

Advances in Petri Nets 1984 pp 353–375Cite as

Semantics of concurrent systems: A modular fixed-point trace approach

  • Conference paper
  • First Online:

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

Abstract

A method for finding the set of processes generated by a concurrent system (the behaviour of a system) in modular way is presented. A system is decomposed into modules with behaviours assumed to be known and then the behaviours are successively put together giving finally the initial system behaviour. It is shown that there is much of freedom in choice of modules; in extreme case atoms of a system, i.e. subsystems containing only one resource, can be taken as modules; each atom has its behaviour defined a proiri. The basic operation used for composing behaviours is the synchronization operation defined in the paper. The fixed point method of describing sets of processes is extensively applied, with processes regarded as traces rather than strings of actions.

This paper has been prepared during its author's stay at Institute for Foundations of Information Technology GMD MBH Bonn.

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. Aalbersberg, IJ.J., Rozenberg, G.: Trace Theory — a Survey, Technical Report, Inst. of Appl. Math. and Comp. Sci., University of Leiden, 1984.

    Google Scholar 

  2. Genrich, H.J., Lautenbach, K., Thiagarajan, P.S.: Elements of General Net Theory, LNCS 84, 1980.

    Google Scholar 

  3. Györy, G., Knuth, E., Romai, L.: Grammatical Projections, Working Paper of Comp. and Automation Institute, Hungarian Academy of Sciences, 1979.

    Google Scholar 

  4. Hoare, C.A.R.: Communicating Sequential Processes, CACM 21/8, 1978.

    Google Scholar 

  5. Lauer, P.E., Shields, M.W., Best, E.: Design and Analysis of Highly Parallel and Distributed Systems, LNCS 86, 1979.

    Google Scholar 

  6. Levi, F.W.: On semigroups, Bulletin of the Calcutta Mathematical Society, 36, pp.141–146, 1944.

    Google Scholar 

  7. Mazurkiewicz, A.: Concurrent Program Schemes and Their Interpretations, DAIMI Report PB — 78, Aarhus University, 1977.

    Google Scholar 

  8. Milner, R.: A Calculus of Communicating Systems, LNCS 92, 1980.

    Google Scholar 

  9. Petri, C.A.: Nonsequential Processes, ISF Report 77.05, St.Augustin, GMD Bonn, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science PAS, PKiN, P.O. Box 22, PL 00-901, Warszawa, Poland

    A. Mazurkiewicz

Authors
  1. A. Mazurkiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

G. Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mazurkiewicz, A. (1985). Semantics of concurrent systems: A modular fixed-point trace approach. In: Rozenberg, G. (eds) Advances in Petri Nets 1984. Lecture Notes in Computer Science, vol 188. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15204-0_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-15204-0_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15204-0

  • Online ISBN: 978-3-540-39320-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation