Skip to main content
SpringerLink
Log in

Testing Undecidability of the Reachability in Petri Nets with the Help of 10th Hilbert Problem

  • Conference paper
  • First Online:
Book cover Application and Theory of Petri Nets 1999 (ICATPN 1999)

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

Included in the following conference series:

  • 364 Accesses

Abstract

The 10th Hilbert problem is used as a test for undecidability of reachability problem in some classes of Petri Nets, such as self-modifying nets, nets with priorities and nets with inhibitor arcs. Common method is proposed in which implementing in a weak sense the multiplication in a given class of Petri nets including PT-nets is sufficient for such undecidability.

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. C. Dufourd, A. Finkel, Ph. Schnoebelen, Reset nets: between decidability and undecidability, Proceedings ICALP 98, Aalborg (1998)

    Google Scholar 

  2. M. Hack, Decidability question for Petri nets, PhD thesis, Department of Electrical Engineering, MIT 1974.

    Google Scholar 

  3. M. Hack, The equality problem for vector addition systems is undecidable, Th. Comp. Sc. 1976, 2, pp 77–95 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  4. E. Kindler, Private communication.

    Google Scholar 

  5. S.R. Kosaraju, Decidability of Reachability in Vector Addition Systems, In Proc. of the 14th Annual ACM Symp. on Theory of Computing, San Francisco, May 5-7, 1982, pages 267–281 (1982)

    Google Scholar 

  6. Y. Matijasevich, Enumerable sets are Diophantine(in Russian), Dokl. Akad. Nauk SSSR, 191, pp 279–282 (1970). Translation in: Soviet Math. Doklady, 12 pp 249-254, (1971)

    Google Scholar 

  7. E. Mayr, An algorithm for the general Petri net reachability problem. Proceedings of the 13th Ann. ACM Symposium on Theory of Computing, May 11-13, 1981 (Milwaukee, WI), pp. 238–246. Also: SIAM Journal on Computing 13, 3, pp. 441-460.

    Google Scholar 

  8. A. Tarlecki, An obvious observation on functions computable by Petri Nets, SIG Petri Nets and Related Models, Newsletter 13 (February 1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Warsaw University, ul.Banacha 2, 02-097, Warszawa, Poland

    Piotr Chrząstowski-Wachtel

Authors
  1. Piotr Chrząstowski-Wachtel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università di Torino, C.so Svizzera 185, I-10149, Torino, Italy

    Susanna Donatelli

  2. LIACS, Leiden University , 2300 RA, Leiden, The Netherlands

    Jetty Kleijn

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chrząstowski-Wachtel, P. (1999). Testing Undecidability of the Reachability in Petri Nets with the Help of 10th Hilbert Problem. In: Donatelli, S., Kleijn, J. (eds) Application and Theory of Petri Nets 1999. ICATPN 1999. Lecture Notes in Computer Science, vol 1639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48745-X_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-48745-X_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66132-0

  • Online ISBN: 978-3-540-48745-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation