Skip to main content

Eliminating Internal Behaviour in Petri Nets

  • Conference paper
Book cover Applications and Theory of Petri Nets 2004 (ICATPN 2004)

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

Included in the following conference series:

Abstract

A safe labelled marked graph (Petri Net) with internal transitions can be transformed into a pomset-equivalent safe labelled marked graph without internal transitions.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Best, E., Fernández, C.: Nonsequential Processes: A Petri Net View. EATCS Monographs on Theoretical Computer Science, vol. 13. Springer, Heidelberg (1988)

    MATH  Google Scholar 

  2. Best, E.: Semantics of Sequential and Nonsequential Programs. Prentice-Hall, Englewood Cliffs (1996)

    Google Scholar 

  3. Best, E., Devillers, R.: Sequential and Concurrent Behaviour in Petri Net Theory. Theoretical Computer Science 55, 87–136 (1988)

    Article  MathSciNet  Google Scholar 

  4. Best, E., Wimmel, H.: Reducing k-Safe Petri Nets to Pomset-Equivalent 1-Safe Petri Nets. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 63–82. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  5. Commoner, F., Holt, A., Even, S., Pnueli, A.: Marked Directed Graphs. Journal of Computer and System Sciences 5, 511–523 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  6. Genrich, H.J., Lautenbach, K.: Synchronisationsgraphen. Acta Informatica 2, 143–161 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  7. Nielsen, M., Thiagarajan, P.S.: Regular Event Structures and Finite Petri Nets: The Conflict-Free Case. In: Esparza, J., Lakos, C.A. (eds.) ICATPN 2002. LNCS, vol. 2360, p. 335. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  8. Pratt, V.: Modelling Concurrency with Partial Orders. International Journal of Parallel Programming 15, 33–71 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  9. Priese, L., Wimmel, H.: Petri-Netze, p. 376. Springer, Heidelberg (2003) ISBN 3-540-44289-8

    MATH  Google Scholar 

  10. Priese, L., Wimmel, H.: A Uniform Approach to True-Concurrency and Interleaving Semantics for Petri-Nets. Theoretical Computer Science 206, 219–256 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  11. Starke, P.H.: Analyse von Petri-Netz-Modellen. Teubner, Stuttgart (1990)

    MATH  Google Scholar 

  12. Wimmel, H.: Algebraische Semantiken für Petri-Netze (Dissertation). Universität Koblenz-Landau (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wimmel, H. (2004). Eliminating Internal Behaviour in Petri Nets. In: Cortadella, J., Reisig, W. (eds) Applications and Theory of Petri Nets 2004. ICATPN 2004. Lecture Notes in Computer Science, vol 3099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27793-4_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27793-4_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22236-1

  • Online ISBN: 978-3-540-27793-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics