Skip to main content
SpringerLink
Log in

Faster Verification of Partially Ordered Runs in Petri Nets Using Compact Tokenflows

  • Conference paper
Application and Theory of Petri Nets and Concurrency (PETRI NETS 2013)

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

Abstract

In this paper we tackle the problem of verifying whether a labeled partial order (LPO) is executable in a Petri net. In contrast to sequentially ordered runs an LPO includes both, information about dependencies and independencies of events. Consequently an LPO allows a precise and intuitive specification of the behavior of a concurrent or distributed system. In this paper we consider Petri nets with arc weights, namely marked place/transition-nets (p/t-nets). Accordingly the question is whether a given LPO is an execution of a given p/t-net.

Different approaches exist to define the partial language (i.e. the set of executions) of a p/t-net. Each definition yields a different verification algorithm, but in terms of runtime all these algorithms perform quite poorly for most examples. In this paper a new compact characterization of the partial language of a p/t-net will be introduced, optimized with respect to the verification problem. The goal is to develop an algorithm to efficiently decide the verification problem.

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. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: Theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs (1993)

    MATH  Google Scholar 

  2. Baumgarten, B.: Petri-Netze: Grundlagen und Anwendungen. Spektrum, Heidelberg (1996)

    Google Scholar 

  3. Bergenthum, R.: Algorithmen zur Verifikation von halbgeordneten Petrinetz-Abläufen: Implementierung und Anwendungen. Diplomarbeit, Katholische Universität Eichstätt-Ingolstadt (2006)

    Google Scholar 

  4. Bergenthum, R., Desel, J., Juhás, G., Lorenz, R.: Can I Execute My Scenario in Your Net? VipTool Tells You! In: Donatelli, S., Thiagarajan, P.S. (eds.) ICATPN 2006. LNCS, vol. 4024, pp. 381–390. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Synthesis of Petri Nets from Finite Partial Languages. Fundamenta Informaticae 88(4), 437–468 (2008)

    MathSciNet  MATH  Google Scholar 

  6. Bergenthum, R., Desel, J., Mauser, S.: Comparison of Different Algorithms to Synthesize a Petri Net from a Partial Language. In: Jensen, K., Billington, J., Koutny, M. (eds.) ToPNoC III, LNCS, vol. 5800, pp. 216–243. Springer, Heidelberg (2009)

    Google Scholar 

  7. Bergenthum, R., Desel, J., Mauser, S., Lorenz, R.: Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages. Fundamenta Informaticae 95(1), 187–217 (2009)

    MathSciNet  MATH  Google Scholar 

  8. Bergenthum, R., Juhás, G., Lorenz, R., Mauser, S.: Unfolding Semantics of Petri Nets Based on Token Flows. Fundamenta Informaticae 94(3-4), 331–360 (2009)

    MathSciNet  Google Scholar 

  9. Bergenthum, R., Lorenz, R., Mauser, S.: Faster Unfolding of General Petri Nets Based on Token Flows. In: van Hee, K.M., Valk, R. (eds.) PETRI NETS 2008. LNCS, vol. 5062, pp. 13–32. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Best, E., Devillers, R.: Sequential and concurrent behaviour in Petri net theory. Theoretical Computer Science 55(1), 87–136

    Google Scholar 

  11. Desel, J., Juhás, G.: “What Is a Petri Net?” Informal Answers for the Informed Reader. In: Ehrig, H., Juhás, G., Padberg, J., Rozenberg, G. (eds.) Unifying Petri Nets, LNCS, vol. 2128, pp. 1–25. Springer, Heidelberg (2001)

    Google Scholar 

  12. Desel, J., Juhás, G., Lorenz, R., Neumair, C.: Modelling and Validation with VipTool. In: van der Aalst, W.M.P., ter Hofstede, A.H.M., Weske, M. (eds.) BPM 2003. LNCS, vol. 2678, pp. 380–389. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Desel, J., Reisig, W.: Place/Transition Petri Nets. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 122–173. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  14. Dinic, E.A.: Algorithm for Solution of a Problem of Maximum Flow in a Network with Power Estimation. Soviet Math Doklady 11, 1277–1280 (1970)

    Google Scholar 

  15. Esparza, J., Römer, S., Vogler, W.: An Improvement of McMillan’s Unfolding Algorithm. Formal Methods in System Design 20(3), 285–310 (2002)

    Article  MATH  Google Scholar 

  16. Ford, L.R., Fulkerson, D.R.: Maximal Flow Through A Network. Canadian Journal of Mathematics 8, 399–404 (1956)

    Article  MathSciNet  MATH  Google Scholar 

  17. Goltz, U., Reisig, W.: Processes of Place/Transition-Nets. In: Díaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 264–277. Springer, Heidelberg (1983)

    Chapter  Google Scholar 

  18. Goltz, U., Reisig, W.: The Non-sequential Behavior of Petri Nets. Information and Control 57(2/3), 125–147 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  19. Grabowski, J.: On partial languages. Fundamenta Informaticae 4(2), 427–498 (1981)

    MathSciNet  MATH  Google Scholar 

  20. Janicki, R., Koutny, M.: Structure of concurrency. Theoretical Computer Science 112(1), 5–52 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  21. Juhás, G., Lorenz, R., Desel, J.: Can I Execute My Scenario in Your Net? In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 289–308. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  22. Karzanov, A.V.: Determining the maximal flow in a network by the method of preflows. Soviet Mathematics Doklady 15, 434–437 (1974)

    MATH  Google Scholar 

  23. Kiehn, A.: On the Interrelation Between Synchronized and Non-Synchronized Behaviour of Petri Nets. Elektronische Informationsverarbeitung und Kybernetik 24(1/2), 3–18 (1988)

    MathSciNet  MATH  Google Scholar 

  24. Lorenz, R.: Szenario-basierte Verifikation und Synthese von Petrinetzen: Theorie und Anwendungen, Katholische Universität Eichstätt-Ingolstadt. Habilitation (2006)

    Google Scholar 

  25. Lorenz, R., Mauser, S., Bergenthum, R.: Testing the executability of scenarios in general inhibitor nets. In: Basten, T., Juhás, G., Shukla, S.K. (eds.) Proc. of Application of Concurrency to System Design 2007, pp. 167–176. IEEE Computer Society (2007)

    Google Scholar 

  26. Malhotra, V.M., Kumar, M.P., Maheshwari, S.N.: An O(|V| 3) Algorithm for Finding Maximum Flows in Networks. Information Processing Letters 7(6), 277–278 (1994)

    Article  MathSciNet  Google Scholar 

  27. McMillan, K.L., Probst, D.K.: A Technique of State Space Search Based on Unfolding. Formal Methods in System Design, 45–65 (1992)

    Google Scholar 

  28. de Oliveira Oliveira, M.: Hasse Diagram Generators and Petri Net. Fundamenta Informaticae 105(3), 263–289 (2012)

    Google Scholar 

  29. Peterson, J.L.: Petri net theory and the modeling of systems. Prentice-Hall, Englewood Cliffs (1981)

    Google Scholar 

  30. Petri, C.A.: Kommunikation mit Automaten, Dissertation, Technische Universität Darmstadt (1962)

    Google Scholar 

  31. Pratt, V.: Modelling Concurrency with Partial Orders. International Journal of Parallel Programming 15 (1986)

    Google Scholar 

  32. Reisig, W.: Petrinetze: Eine Einführung. Springer, Berlin (1986)

    Google Scholar 

  33. Solé, M., Carmona, J.: Process Mining from a Basis of State Regions. In: Lilius, J., Penczek, W. (eds.) PETRI NETS 2010. LNCS, vol. 6128, pp. 226–245. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  34. Vogler, W. (ed.): Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol. 625. Springer, Heidelberg (1992)

    Google Scholar 

  35. Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Software Engineering and Theory of Programming, FernUniversität in Hagen, Germany

    Robin Bergenthum

Authors
  1. Robin Bergenthum
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Informática e Ingeniería de Sistemas, Universidad de Zaragoza, María de Luna, 1, 50018, Zaragoza, Spain

    José-Manuel Colom

  2. Fernuniversität Hagen, IZ, Universitätsstraße 1, 58097, Hagen, Germany

    Jörg Desel

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bergenthum, R. (2013). Faster Verification of Partially Ordered Runs in Petri Nets Using Compact Tokenflows. In: Colom, JM., Desel, J. (eds) Application and Theory of Petri Nets and Concurrency. PETRI NETS 2013. Lecture Notes in Computer Science, vol 7927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38697-8_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38697-8_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38696-1

  • Online ISBN: 978-3-642-38697-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation