Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1984: Mathematical Foundations of Computer Science 1984 pp 115–133Cite as

Traces, histories, graphs: Instances of a process monoid

  • Invited Lectures
  • Conference paper
  • First Online:

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

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

    Google Scholar 

  2. Bertoni,A., Mauri,G.,Sabadini,N.: Equivalence and Membership Problems for Regular Trace Languages, LNCS 88, Springer Verlag, 1980

    Google Scholar 

  3. —: Behaviour of CE Petri Nets an Recognizable Trace Languages, Internal Report Istituto di Cibernetica Milano, 1982

    Google Scholar 

  4. —: A Hierarchy of Regular Trace Languages and Some Combinatorial Applications, Proc. II World Conf. on Mathematics at service of the man, 1982

    Google Scholar 

  5. Genrich,H. J., Lautenbach,K., Thiagarajan,P.S.: Elements of General Net Theory, in Net Theory and Application (Brauer, W. editor)LNCS 84, Springer Verlag, 1980

    Google Scholar 

  6. Janicki,R.: Mazurkiewicz Traces Semantics for Communication Sequential systems, 5th European Workshop on Applications and Theory of Petri Nets, 1984

    Google Scholar 

  7. Janssen,D.,Kreowski,H.J.,Rozenberg,G.,Ehrig,H.: Concurrency of Node-Label-Controlled Graph Transformations, Proc. of 8th Conf. on Graph-Theoretic Concepts in Computer Science, Hanser Verlag, 1982

    Google Scholar 

  8. Knuth,E.&al: A Study of the Projection Operation, Springer Verlag, Inf. Fachb. 52, 1982

    Google Scholar 

  9. Knuth,F.: Petri Nets and Trace Languages, Proc. Ist European Conf. on Parallel and Distributed Processing, Toulouse, 1979

    Google Scholar 

  10. Kreowski,H.J.: Graph Grammar Derivation Processes, manuscript, 1984

    Google Scholar 

  11. Lamport,L.: Time, Clocks, and the Ordering of Events in Distributive Systems, CACM,7, 1978

    Google Scholar 

  12. Lauer,P.E., Shields,M.W., Best,E.: Formal Theory of the Basic COSY Notation, Univ. of Newcastle upon Tyne, Comp.Lab. TR 143, 1979

    Google Scholar 

  13. Mazurkiewicz,A.: Concurrent Program Schemes and Their Interpretations, Aarhus University, DAIMI Rep. PB 78, 1977

    Google Scholar 

  14. —: The Semantics of Concurrent Systems: A Modular Fixed Point Trace Approach, 5th European Workshop on Applications and Theory of Petri Nets, 1984

    Google Scholar 

  15. Petri,C.A.: Non-Sequential Processes. ISF Report 77.05, Gesellschaft für Mathematik und Datenverarbeitung mbH Bonn, 1977

    Google Scholar 

  16. —: Fundamentals of the Representation of Discrete Processes, ISF Report 82.04, Gesellschaft für Mathematik und Datenverarbeitung mbH Bonn, 1982

    Google Scholar 

  17. Reisig, W.: Petrinetze, Springer Verlag, Berlin-Heidelberg-New York, 1982

    Google Scholar 

  18. Shields,M.W.: NonSequential Behaviour:1, University of Edinburgh, Dept. of Comp.Sci., Internal Report CSR-120-82, 1982

    Google Scholar 

  19. —: Adequate Path Expressions, Proc. of Symposium on the Semantics of Concurrent Computation, LNCS 70, Springer Verlag, 1979

    Google Scholar 

  20. Starke,P.: Processes in Petri Nets, Elektron. Informationsverarbeitung und Kybernetik, 17, 1981

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IPI PAN, PKiN, S.P.22, PL 00-901, Warszawa

    Antoni Mazurkiewicz

Authors
  1. Antoni Mazurkiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. P. Chytil V. Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mazurkiewicz, A. (1984). Traces, histories, graphs: Instances of a process monoid. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030293

Download citation

  • DOI: https://doi.org/10.1007/BFb0030293

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13372-8

  • Online ISBN: 978-3-540-38929-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation