Skip to main content
SpringerLink
Log in
Book cover

Automata, Languages and Programming pp 190–199Cite as

General Morphisms of Petri Nets (Extended Abstract)

  • Conference paper
  • First Online:

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

Abstract

A new notion of a general morphism of Petri nets is introduced. The new morphisms are shown to properly include the morphisms considered so far. The resulting category of Petri nets is shown to admit products. Potential applications of general morphisms are indicated.

Partially supported by LoSSeD workpackage within the CRIT-2 project funded by ESPRIT and INCO programmes, and by the State Committee for Scientific Research grants 8 T11C 018 11 and 8 T11C 037 16.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Badouel and P. Darondeau. Theory of regions, 1998. Manuscript.

    Google Scholar 

  2. M.A. Bednarczyk. Categories of Asynchronous Systems. Ph.D. thesis, University of Sussex, England, 1988. CST 1-88.

    Google Scholar 

  3. M.A. Bednarczyk and A.M. Borzyszkowski. General morphisms of Petri nets, 1999. IPIPAN Technical Report 874 (24pp).

    Google Scholar 

  4. M.A. Bednarczyk and A.M. Borzyszkowski. Concurrent realizations of reactive systems, 1999. Submitted.

    Google Scholar 

  5. C. Brown and D. Gurr. Refinement and simulation of nets-a categorical characterization. In K. Jensen, ed., Proc. Applications and Theory of Petri Nets, vol. 616 of LNCS, pp. 76–92. Springer, 1992.

    Google Scholar 

  6. M. Droste and R.M. Schortt. Petri nets and automata with concurency relation-an adjunction. In M. Droste and Y. Gurevich, eds., Proc. Semantics of Programming Languages and Model Theory, pp. 69–87, 1993.

    Google Scholar 

  7. C. Duboc. Mixed products and asynchronous automata. Theoretical Computer Science, vol. 48: pp. 183–199, 1986.

    Article  MathSciNet  Google Scholar 

  8. A. Ehrenfeucht and G. Rozenberg. Partial (set) 2-structures, part I and II. Acta Informatica, vol. 27(4): pp. 315–368, 1990.

    Article  MathSciNet  Google Scholar 

  9. J. Meseguer and U. Montanari. Petri nets are monoids. Information and Computation, vol. 88: pp. 105–155, 1990.

    Article  MathSciNet  Google Scholar 

  10. R. Morin. Decompositions of asynchronous systems. In Proc. CONCUR’98, LNCS, pp. 549–564. Springer, 1998.

    Google Scholar 

  11. M. Nielsen, G. Rozenberg, and P.S. Thiagarajan. Elementary transition systems. Theoretical Computer Science, vol. 96: pp. 3–33, 1992.

    Article  MathSciNet  Google Scholar 

  12. C.A. Petri. Fundamentals of a theory of asynchronous information flow. In Proc. IFIP’62. North Holland, 1962.

    Google Scholar 

  13. M. Shields. Multitraces, hipertraces and partial order semantics. Formal Aspects of Computing, vol. 4: pp. 649–672, 1992.

    Article  Google Scholar 

  14. G. Winskel. Petri nets, algebras, morphisms and compositionality. Information Computation, 1987.

    Google Scholar 

  15. G. Winskel. A category of labelled Petri nets and compositional proof system (extended abstract). In Proc. Third IEEE Symposium on Logic in Computer Science, pp. 142–154. IEEE, The Computer Society, Computer Society Press, 1988.

    Google Scholar 

  16. W. Zielonka. Notes on finite asynchronous automata. Theoretical Informatics and Applications, vol. 21(2): pp. 99–135, 1987.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Gdaŕisk Branch, Polish Acad. of Sc., Abrahama 18, 81-825, Sopot, Poland

    Marek A. Bednarczyk & Andrzej M. Borzyszkowski

Authors
  1. Marek A. Bednarczyk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej M. Borzyszkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Computer Science, Academy of Sciences of the Czech Republic, Pod vodarenskou vezi 2, 182 07, Prague 8 - Liben, Czech Republic

    Jirí Wiedermann

  2. ILLC-WINS-University of Amsterdam, Plantage Muidergracht 24, 1018, TV, Amsterdam, The Netherlands

    Peter van Emde Boas

  3. BRICS, Department of Computer Science, University of Aarhus, Ny Munkegade, Bldg. 540, DK, 8000, Aarhus C, Denmark

    Mogens Nielsen

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bednarczyk, M.A., Borzyszkowski, A.M. (1999). General Morphisms of Petri Nets (Extended Abstract). In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds) Automata, Languages and Programming. Lecture Notes in Computer Science, vol 1644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48523-6_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-48523-6_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66224-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation