Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1992: Automata, Languages and Programming pp 571–582Cite as

Timing Petri Nets categorically

  • Conference paper
  • First Online:

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

Abstract

We establish a precise connection between the two distinct ways in which category theory has been applied to the study of Petri Nets. This connection relates morphisms between nets which consider only their static structure to morphisms on their purely dynamic behaviour, and is based on a CCS-like notion of simulation. We apply these results to the timing of Petri Nets.

Supported by ESPRIT CEDISYS and CLICS and Danish DART grants.

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. C. T. Brown and D. J. Gurr, Timing Petri Nets, manuscript, December 1990.

    Google Scholar 

  2. C. T. Brown, D. J. Gurr, and V. C. V. de Paiva, A Linear Specification Language for Petri Nets, Technical Report DAIMI PB — 363, DAIMI, Århus University, 1991.

    Google Scholar 

  3. P. Degano, J. Meseguer, and U. Montanari, Axiomatizing Net Computations and Processes, in Proc. LICS, 1989.

    Google Scholar 

  4. V. Gehlot and C. Gunter, A Proof-Theoretic Operational Semantics for True Concurrency, in Proc. LICS, 1990.

    Google Scholar 

  5. D. J. Gurr, Semantic Frameworks for Complexity, PhD thesis ECS-LFCS-91-130, University of Edinburgh, 1990.

    Google Scholar 

  6. K. Jensen, Coloured Petri Nets: a high level language for system design analysis, in G. Rozenberg, editor, Proc. Advances in Petri nets, Springer-Verlag, 1990.

    Google Scholar 

  7. J. Meseguer and U. Montanari, Petri Nets are Monoids: A new algebraic foundation for net theory, Technical Report SRI-CSL-88-3, C.S. Lab., SRI International, January 1988.

    Google Scholar 

  8. M. Nielsen and G. Winskel, Concurrency, to appear as a chapter in the Handbook of Theoretical Computer Science.

    Google Scholar 

  9. W. Reisig, Petri Nets: an Introduction, EATCS Monographs on Theoretical Computer Science Springer-Verlag, 1985.

    Google Scholar 

  10. G. Winskel, Categories of Models for Concurrency, In S.D. Brookes, A.W. Roscoe, and G. Winskel, editors, Proc. Seminar on Semantics of Concurrency (CMU, Pittsburgh), LNCS 197, Springer-Verlag, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DAIMI, Århus University, Denmark

    Carolyn Brown & Doug Gurr

Authors
  1. Carolyn Brown
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Doug Gurr
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

W. Kuich

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brown, C., Gurr, D. (1992). Timing Petri Nets categorically. In: Kuich, W. (eds) Automata, Languages and Programming. ICALP 1992. Lecture Notes in Computer Science, vol 623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55719-9_105

Download citation

  • DOI: https://doi.org/10.1007/3-540-55719-9_105

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55719-7

  • Online ISBN: 978-3-540-47278-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation