Skip to main content
SpringerLink
Log in

P- and T-Systems in the Nets-within-Nets-Formalism

  • Conference paper
Book cover Application and Theory of Petri Nets (PETRI NETS 2012)

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

  • 1248 Accesses

Abstract

We are concerned with (strongly deterministic) generalised state machines (GSMs), a restricted formalism of the nets-within-nets-family, and further restrict the involved nets to P- and T-nets. While GSMs with these restrictions are likely to be of little use in modelling applications, understanding them better might help in future attempts to analyse more sophisticated formalisms.

We show that, given a strongly deterministic GSM where the system net and all object nets are P-nets, it is PSpace-complete to decide the reachability of a given marking. In past work we have already shown that the same restriction to T-nets remains solvable in polynomial time. We discuss this work in the context given here. At last we give some initial results concerning other combinations of restricting the system and/or the object nets to P- and/or T-nets. Throughout we also discuss the effect of dropping the restriction to strongly deterministic GSMs.

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. Bednarczyk, M.A., Bernardinello, L., Pawłowski, W., Pomello, L.: Modelling Mobility with Petri Hypernets. In: Fiadeiro, J.L., Mosses, P.D., Orejas, F. (eds.) WADT 2004. LNCS, vol. 3423, pp. 28–44. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Cardelli, L., Gordon, A.D.: Mobile ambients. Theoretical Computer Science 240, 177–213 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  3. Castagna, G., Vitek, J., Nardelli, F.Z.: The seal calculus. Information and Computation 201, 1–54 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Desel, J., Esparza, J.: Free choice Petri nets. Cambridge University Press, New York (1995)

    Book  MATH  Google Scholar 

  5. Esparza, J.: Decidability and Complexity of Petri Net Problems – an Introduction. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 374–428. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  6. Esparza, J., Nielsen, M.: Decidability issues for petri nets - a survey. J. Inform. Process. Cybernet 30(3), 143–160 (1994)

    MATH  Google Scholar 

  7. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco (1979)

    MATH  Google Scholar 

  8. Haddad, S., Poitrenaud, D.: Theoretical Aspects of Recursive Petri Nets. In: Donatelli, S., Kleijn, J. (eds.) ICATPN 1999. LNCS, vol. 1639, pp. 228–247. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  9. Heitmann, F., Köhler-Bußmeier, M.: On defining conflict-freedom for object nets. In: Farwer, B. (ed.) Proceedings of the International Workshop on Logic, Agents, and Mobility, LAM 2011 (2011)

    Google Scholar 

  10. Heitmann, F., Köhler-Bußmeier, M.: Restricting generalised state machines. In: Szczuka, M., Czaja, L., Skowron, A., Kacprzak, M. (eds.) Proceedings of the Concurrency, Specification and Programming (CS&P 2011), Białystok University of Technology, Pułtusk, Poland (2011)

    Google Scholar 

  11. Hiraishi, K.: PN2: An Elementary Model for Design and Analysis of Multi-agent Systems. In: Arbab, F., Talcott, C. (eds.) COORDINATION 2002. LNCS, vol. 2315, pp. 220–235. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Hoffmann, K., Ehrig, H., Mossakowski, T.: High-Level Nets with Nets and Rules as Tokens. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 268–288. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Jones, N.D., Landweber, L.H., Lien, Y.E.: Complexity of some problems in Petri nets. Theoretical Computer Science 4, 277–299 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  14. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)

    Chapter  Google Scholar 

  15. Köhler, M.: The reachability problem for object nets. Fundamenta Informaticae 79(3-4), 401–413 (2007)

    MathSciNet  MATH  Google Scholar 

  16. Köhler, M., Moldt, D., Rölke, H.: Modelling Mobility and Mobile Agents Using Nets within Nets. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol. 2679, pp. 121–139. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  17. Köhler, M., Rölke, H.: Concurrency for mobile object-net systems. Fundamenta Informaticae 54(2-3) (2003)

    Google Scholar 

  18. Köhler, M., Rölke, H.: Properties of Object Petri Nets. In: Cortadella, J., Reisig, W. (eds.) ICATPN 2004. LNCS, vol. 3099, pp. 278–297. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  19. Köhler, M., Rölke, H.: Reference and Value Semantics Are Equivalent for Ordinary Object Petri Nets. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 309–328. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  20. Köhler-Bußmeier, M.: Hornets: Nets within Nets Combined with Net Algebra. In: Franceschinis, G., Wolf, K. (eds.) PETRI NETS 2009. LNCS, vol. 5606, pp. 243–262. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  21. Köhler-Bußmeier, M., Heitmann, F.: Safeness for object nets. Fundamenta Informaticae 101(1-2), 29–43 (2010)

    MathSciNet  MATH  Google Scholar 

  22. Köhler-Bußmeier, M., Heitmann, F.: Liveness of safe object nets. Fundamenta Informaticae 112(1), 73–87 (2011)

    MathSciNet  MATH  Google Scholar 

  23. Lakos, C.A.: A Petri Net View of Mobility. In: Wang, F. (ed.) FORTE 2005. LNCS, vol. 3731, pp. 174–188. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  24. Lomazova, I.A.: Nested Petri nets – a formalism for specification of multi-agent distributed systems. Fundamenta Informaticae 43(1-4), 195–214 (2000)

    MathSciNet  MATH  Google Scholar 

  25. van Hee, K.M., Lomazova, I.A., Oanea, O., Serebrenik, A., Sidorova, N., Voorhoeve, M.: Nested Nets for Adaptive Systems. In: Donatelli, S., Thiagarajan, P.S. (eds.) ICATPN 2006. LNCS, vol. 4024, pp. 241–260. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  26. Savitch, W.: Relationship between nondeterministic and deterministic tape complexities. J. on Computer and System Sciences 4, 177–192 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  27. Valk, R.: Modelling concurrency by task/flow EN systems. In: 3rd Workshop on Concurrency and Compositionality. No. 191 in GMD-Studien, Gesellschaft für Mathematik und Datenverarbeitung, St. Augustin, Bonn (1991)

    Google Scholar 

  28. Valk, R.: Petri Nets as Token Objects: An Introduction to Elementary Object Nets. In: Desel, J., Silva, M. (eds.) ICATPN 1998. LNCS, vol. 1420, pp. 1–24. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department for Informatics, University of Hamburg, Vogt-Kölln-Straße 30, D-22527, Hamburg, Germany

    Frank Heitmann & Michael Köhler-Bußmeier

Authors
  1. Frank Heitmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Köhler-Bußmeier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratoire Spécification et Vérification, Ecole Normale Supérieure de Cachan, 61, avenue du Président Wilson, 94235, Cachan, France

    Serge Haddad

  2. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano–Bicocca, Viale Sarca, 336, 20126, Milano, Italy

    Lucia Pomello

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heitmann, F., Köhler-Bußmeier, M. (2012). P- and T-Systems in the Nets-within-Nets-Formalism. In: Haddad, S., Pomello, L. (eds) Application and Theory of Petri Nets. PETRI NETS 2012. Lecture Notes in Computer Science, vol 7347. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31131-4_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31131-4_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31130-7

  • Online ISBN: 978-3-642-31131-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation