Skip to main content
SpringerLink
Log in

Transformation of Petri Nets into Context-Dependent Fusion Grammars

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11417))

Abstract

In this paper, we introduce context-dependent fusion grammars as a new type of hypergraph grammars where the application of fusion rules is restricted by positive and negative context conditions. Our main result is that Petri nets can be transformed into these grammars such that the reachable markings are in one-to-one correspondence to the members of the generated language. As a corollary, we get that the membership problem for context-dependent fusion grammars is at least as hard as the reachability problem of Petri nets.

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 EPUB and 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

References

  1. Kreowski, H.-J., Kuske, S., Lye, A.: Fusion grammars: a novel approach to the generation of graph languages. In: de Lara, J., Plump, D. (eds.) ICGT 2017. LNCS, vol. 10373, pp. 90–105. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-61470-0_6

    Chapter  MATH  Google Scholar 

  2. Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)

    Article  Google Scholar 

  3. Czerwinski, W., Lasota, S., Lazic, R., Leroux, J., Mazowiecki, F.: The reachability problem for Petri nets is not elementary. CoRR. arXiv.org, abs/1809.07115 (2018)

  4. Kreowski, H.-J.: A comparison between petri-nets and graph grammars. In: Noltemeier, H. (ed.) WG 1980. LNCS, vol. 100, pp. 306–317. Springer, Heidelberg (1981). https://doi.org/10.1007/3-540-10291-4_22

    Chapter  Google Scholar 

  5. Corradini, A.: Concurrent computing: from Petri nets to graph grammars. Electron. Notes Theoret. Comput. Sci. 2, 56–70 (1995)

    Article  MathSciNet  Google Scholar 

  6. Ehrig, H., Padberg, J.: Graph grammars and Petri net transformations. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol. 3098, pp. 496–536. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-27755-2_14

    Chapter  MATH  Google Scholar 

  7. Desel, J., Reisig, W.: Place/transition Petri nets. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 122–173. Springer, Heidelberg (1998). https://doi.org/10.1007/3-540-65306-6_15

    Chapter  MATH  Google Scholar 

  8. Girault, C., Valk, R.: Petri Nets for Systems Engineering. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-662-05324-9

    Book  MATH  Google Scholar 

  9. Priese, L., Wimmel, H.: Petri-Netze. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-76971-2

    Book  MATH  Google Scholar 

  10. Best, E., Wimmel, H.: Structure theory of Petri nets. In: Jensen, K., van der Aalst, W.M.P., Balbo, G., Koutny, M., Wolf, K. (eds.) Transactions on Petri Nets and Other Models of Concurrency VII. LNCS, vol. 7480, pp. 162–224. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38143-0_5

    Chapter  MATH  Google Scholar 

  11. Reisig, W.: Understanding Petri Nets - Modeling Techniques, Analysis Methods, Case Studies. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-33278-4

    Book  MATH  Google Scholar 

  12. Ehrig, H., Habel, A.: Graph grammars with application conditions. In: Rozenberg, G., Salomaa, A. (eds.) The Book of L, pp. 87–100. Springer, Berlin (1986). https://doi.org/10.1007/978-3-642-95486-3_7

    Chapter  Google Scholar 

  13. Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Fundamenta Inform. 26(3,4), 287–313 (1996)

    MathSciNet  MATH  Google Scholar 

  14. Dediu, A.-H., Klempien-Hinrichs, R., Kreowski, H.-J., Nagy, B.: Contextual hypergraph grammars – a new approach to the generation of hypergraph languages. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 327–338. Springer, Heidelberg (2006). https://doi.org/10.1007/11779148_30

    Chapter  Google Scholar 

  15. Ehrig, H., Hermann, F., Sartorius, C.: Completeness and correctness of model transformations based on triple graph grammars with negative application conditions. In: Proceedings of the 8th International Workshop on Graph Transformation and Visual Modeling Techniques, vol. 18, pp. 1–18 (2009)

    Google Scholar 

  16. Kreowski, H.-J., Kuske, S., Lye, A.: Splicing/fusion grammars and their relation to hypergraph grammars. In: Lambers, L., Weber, J. (eds.) ICGT 2018. LNCS, vol. 10887, pp. 3–19. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-92991-0_1

    Chapter  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Bremen, Department of Computer Science and Mathematics, P.O. Box 33 04 40, 28334, Bremen, Germany

    Hans-Jörg Kreowski, Sabine Kuske & Aaron Lye

Authors
  1. Hans-Jörg Kreowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sabine Kuske
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Aaron Lye
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Aaron Lye .

Editor information

Editors and Affiliations

  1. Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  2. Saint Petersburg State University, St. Petersburg, Russia

    Alexander Okhotin

  3. Ariel University, Ariel, Israel

    Dana Shapira

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kreowski, HJ., Kuske, S., Lye, A. (2019). Transformation of Petri Nets into Context-Dependent Fusion Grammars. In: Martín-Vide, C., Okhotin, A., Shapira, D. (eds) Language and Automata Theory and Applications. LATA 2019. Lecture Notes in Computer Science(), vol 11417. Springer, Cham. https://doi.org/10.1007/978-3-030-13435-8_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-13435-8_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-13434-1

  • Online ISBN: 978-3-030-13435-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation