Skip to main content
SpringerLink
Log in

On Concurrent Realization of Reactive Systems and Their Morphisms

  • Chapter
  • First Online:
Unifying Petri Nets

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

Abstract

The paper introduces the notion of concurrent realization of reactive systems. A framework is also presented in which labelled safe Petri nets as concurrent realizations of concrete asynchronous systems are constructed. The construction is uniform in the sense that it extends to a realization of arbitrary commuting diagrams. We discuss applicability of the framework to construct maximally concurrent realizations of reactive systems.

Partially supported by State Committee for Scientific Research grant 8 T11C 037 16.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

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. In Advances in Petri Nets, vol. 1491 of LNCS, pp. 529–586. Springer, 1998.

    Google Scholar 

  2. E. Badouel, M. A. Bednarczyk and P. Darondeau. Generalized automata and their net representations. In this volume.

    Google Scholar 

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

    Google Scholar 

  4. M. A. Bednarczyk and A. M. Borzyszkowski. Concurrent realizations of reactive systems. In P. R. M. Hofmann, D. Pavlovic, ed., Proc. Category Theory in Computer Science, 8th Conf., Edinburgh, vol. 29 of Electronic Notes in Theoretical Computer Science, pp. 1–19. Elsevier, 1999.

    Google Scholar 

  5. M. A. Bednarczyk and A. M. Borzyszkowski. General morphisms of Petri nets; extended abstract. In M. N. Jiri Wiedermann, Peter van Emde Boas, ed., Proc. Automata, Languages and Programming, 26th Intn’l Coll., Prague, vol. 1644 of LNCS, pp. 190–199. Springer, 1999.

    Chapter  Google Scholar 

  6. M. A. Bednarczyk, A. M. Borzyszkowski and R. Somla. Finite Completeness of Categories of Petri Nets. Fundamenta Informaticæ, vol. 43(1–4): pp. 21–48, 2000.

    MATH  MathSciNet  Google Scholar 

  7. 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 

  8. J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev. Petrify: a tool for manipulating concurrent specifications and synthesis of asynchronous controllers. In IEICE Trans. on Information & Systems, vol. E80-D(3), pp. 315–325, 1997.

    Google Scholar 

  9. J. Cortadella, M. Kishinevsky, L. Lavagno, and A. Yakovlev. Synthesizing Petri nets from state-based models. In Proc. International Conference on Computer Aided Design, pp. 164–171, 1995.

    Google Scholar 

  10. J. Cortadella, M. Kishinevsky, L. Lavagno, and A. Yakovlev. Deriving Petri nets from finite transition systems. In IEEE Transactions on Computers, vol. 47(8), pp. 859–882, 1998.

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  12. M. Droste and R. M. Shortt. Continuous Petri nets and transition systems. In this volume.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  15. E. A. Emerson and E. M. Clarke. Using branching time logic to synthesize synchronizations skeletons. Science of Computer Programming, vol. 2: pp. 241–266, 1982.

    Article  MATH  Google Scholar 

  16. S. MacLane. Categories for the Working Mathematician. Graduate Text in Mathematics. Springer, 1971.

    Google Scholar 

  17. A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI PB-78, Århus University, 1977.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  21. M. Pietkiewicz-Koutny and A. Yakovlev. Non-pure nets and their transition systems. TR. no. 528, Department of Computing Science, University of Newcastle upon Tyne, 1995.

    Google Scholar 

  22. S. Popkorn. First Steps in Modal Logic. Cambridge University Press, 1994.

    Google Scholar 

  23. W. Reisig. Petri Nets. EATCS Monographs in Theoretical Computer Science, vol. 4, Springer-Verlag, 1985.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  25. E. W. Stark. Compositional relational semantics for indeterminate dataflow networks. In Proc. CTCS’89, vol. 389 of LNCS, pp. 52–74. Springer, 1989.

    Google Scholar 

  26. W. Vogler. Executions: a new partial-order semantics for Petri nets. Theoretical Computer Science, vol. 91: pp. 205–238, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  27. W. Vogler. Concurrent implementations of asynchronous transition systems. In Proc. Application and Theory of Petri Nets 1999, ICATPN’99, vol. 1630 of LNCS, pp. 284–303. Springer, 1999.

    Chapter  Google Scholar 

  28. G. Winskel. Petri nets, algebras, morphisms and compositionality. Information and Computation, vol. 72: pp. 197–238, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  29. 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 

  30. G. Winskel and M. Nielsen. Models for concurrency. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, eds., Handbook of Logic in Computer Science; Semantic Modeling, vol. 4, pp. 1–148. Oxford University Press, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Gdańsk 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. Institut für Softwaretechnik und Theoretische Informatik, Technische Universität Berlin, Franklinstr. 28/29, 10587, Berlin, Germany

    Hartmut Ehrig  & Julia Padberg  & 

  2. Katholische Universität Eichstätt, Ostenstr. 28, 85072, Eichstätt, Germany

    Gabriel Juhás

  3. Leiden Institute of Advanced Computer Science, Leiden University, Niels Bohrweg 1, 2333, CA Leiden, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bednarczyk, M.A., Borzyszkowski, A.M. (2001). On Concurrent Realization of Reactive Systems and Their Morphisms. In: Ehrig, H., Padberg, J., Juhás, G., Rozenberg, G. (eds) Unifying Petri Nets. Lecture Notes in Computer Science, vol 2128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45541-8_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-45541-8_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43067-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation