Skip to main content
SpringerLink
Log in

Gradient-Based Variable Ordering of Decision Diagrams for Systems with Structural Units

  • Conference paper
  • First Online:
Automated Technology for Verification and Analysis (ATVA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 10482))

Abstract

This paper presents Gradient-\(\varPi \), a novel heuristics for finding the variable ordering of Decision Diagrams encoding the state space of Petri net systems. Gradient-\(\varPi \) combines the structural informations of the Petri net (either the set of minimal P-semiflows or, when available, the structure of the net in terms of “Nested Units”) with a gradient-based greedy strategy inspired by methods for matrix bandwidth reduction. The value of the proposed heuristics is assessed on a public benchmark of Petri net models, showing that Gradient-\(\varPi \) can successfully exploit the structural information to produce good variable orderings.

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

Similar content being viewed by others

Notes

  1. 1.

    Model details can be found in http://mcc.lip6.fr/pdf/SwimmingPool-form.pdf.

References

  1. Van der Aalst, W.M.: The application of Petri nets to workflow management. J. Circ. Syst. Comput. 8(1), 21–66 (1998)

    Article  Google Scholar 

  2. Ajmone-Marsan, M., Balbo, G., Conte, G., Donatelli, S., Franceschinis, G.: Modelling with Generalized Stochastic Petri Nets. Wiley, Hoboken (1995)

    MATH  Google Scholar 

  3. Aloul, F.A., Markov, I.L., Sakallah, K.A.: FORCE: a fast and easy-to-implement variable-ordering heuristic. In: Proceedings of GLSVLSI, pp. 116–119. ACM, New York (2003)

    Google Scholar 

  4. Amparore, E.G., Balbo, G., Beccuti, M., Donatelli, S., Franceschinis, G.: 30 years of GreatSPN. In: Fiondella, L., Puliafito, A. (eds.) Principles of Performance and Reliability Modeling and Evaluation: Essays in Honor of Kishor Trivedi. SSRE, pp. 227–254. Springer, Cham (2016). doi:10.1007/978-3-319-30599-8_9

    Chapter  Google Scholar 

  5. Amparore, E.G., Beccuti, M., Donatelli, S.: (Stochastic) model checking in GreatSPN. In: Ciardo, G., Kindler, E. (eds.) PETRI NETS 2014. LNCS, vol. 8489, pp. 354–363. Springer, Cham (2014). doi:10.1007/978-3-319-07734-5_19

    Chapter  Google Scholar 

  6. Amparore, E.G., Donatelli, S., Beccuti, M., Garbi, G., Miner, A.: Decision diagrams for Petri nets: which variable ordering? In: Petri Net Performance Engineering conference (PNSE), pp. 31–50. CEUR-WS (2017)

    Google Scholar 

  7. Babar, J., Miner, A.: Meddly: multi-terminal and edge-valued decision diagram library. In: International Conference on Quantitative Evaluation of Systems, Los Alamitos, CA, USA, pp. 195–196. IEEE Computer Society (2010)

    Google Scholar 

  8. Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. 35, 677–691 (1986)

    Article  MATH  Google Scholar 

  9. Cassandras, C.G., Lafortune, S.: Introduction to Discrete Event Systems. Springer, Secaucus (2006)

    MATH  Google Scholar 

  10. Ciardo, G., Lüttgen, G., Siminiceanu, R.: Saturation: an efficient iteration strategy for symbolic state-space generation. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 328–342. Springer, Heidelberg (2001). doi:10.1007/3-540-45319-9_23

    Chapter  Google Scholar 

  11. Ciardo, G., Lüttgen, G., Yu, A.J.: Improving static variable orders via invariants. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 83–103. Springer, Heidelberg (2007). doi:10.1007/978-3-540-73094-1_8

    Chapter  Google Scholar 

  12. Colom, J.M., Silva, M.: Convex geometry and semiflows in P/T nets. A comparative study of algorithms for computation of minimal p-semiflows. In: Rozenberg, G. (ed.) ICATPN 1989. LNCS, vol. 483, pp. 79–112. Springer, Heidelberg (1991). doi:10.1007/3-540-53863-1_22

    Chapter  Google Scholar 

  13. Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of the 1969 24th National Conference, pp. 157–172. ACM, New York (1969)

    Google Scholar 

  14. Kordon, F., et al.: Complete Results for the 2016th Edition of the Model Checking Contest. http://mcc.lip.6.fr/2016/results.php

  15. Garavel, H.: Nested-unit Petri nets: a structural means to increase efficiency and scalability of verification on elementary nets. In: Devillers, R., Valmari, A. (eds.) PETRI NETS 2015. LNCS, vol. 9115, pp. 179–199. Springer, Cham (2015). doi:10.1007/978-3-319-19488-2_9

    Chapter  Google Scholar 

  16. Heiner, M., Rohr, C., Schwarick, M., Tovchigrechko, A.A.: MARCIE’s secrets of efficient model checking. In: Koutny, M., Desel, J., Kleijn, J. (eds.) Transactions on Petri Nets and Other Models of Concurrency XI. LNCS, vol. 9930, pp. 286–296. Springer, Heidelberg (2016). doi:10.1007/978-3-662-53401-4_14

    Chapter  Google Scholar 

  17. King, I.P.: An automatic reordering scheme for simultaneous equations derived from network systems. J. Numer. Methods Eng. 2(4), 523–533 (1970)

    Article  Google Scholar 

  18. Kumfert, G., Pothen, A.: Two improved algorithms for envelope and wavefront reduction. BIT Numer. Math. 37(3), 559–590 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  19. Lu, Y., Jain, J., Clarke, E., Fujita, M.: Efficient variable ordering using a BDD based sampling. In: Proceedings of the 37th Annual Design Automation Conference, DAC 2000, pp. 687–692. ACM, New York (2000)

    Google Scholar 

  20. Malik, S., Wang, A.R., Brayton, R.K., Sangiovanni-Vincentelli, A.: Logic verification using binary decision diagrams in a logic synthesis environment. In: IEEE International Conference on Computer-Aided Design (ICCAD), pp. 6–9, November 1988

    Google Scholar 

  21. Meijer, J., van de Pol, J.: Bandwidth and wavefront reduction for static variable ordering in symbolic reachability analysis. In: Rayadurgam, S., Tkachuk, O. (eds.) NFM 2016. LNCS, vol. 9690, pp. 255–271. Springer, Cham (2016). doi:10.1007/978-3-319-40648-0_20

    Chapter  Google Scholar 

  22. Noack, A.: A ZBDD package for efficient model checking of Petri nets (in German). Ph.D. thesis, BTU Cottbus, Department of CS (1999)

    Google Scholar 

  23. Rice, M., Kulhari, S.: A survey of static variable ordering heuristics for efficient BDD/MDD construction. Technical report, University of California (2008)

    Google Scholar 

  24. Roig, O., Cortadella, J., Pastor, E.: Verification of asynchronous circuits by BDD-based model checking of Petri nets. In: De Michelis, G., Diaz, M. (eds.) ICATPN 1995. LNCS, vol. 935, pp. 374–391. Springer, Heidelberg (1995). doi:10.1007/3-540-60029-9_50

    Chapter  Google Scholar 

  25. Schmidt, K.: Using Petri net invariants in state space construction. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 473–488. Springer, Heidelberg (2003). doi:10.1007/3-540-36577-X_35

    Chapter  Google Scholar 

  26. Siminiceanu, R.I., Ciardo, G.: New metrics for static variable ordering in decision diagrams. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 90–104. Springer, Heidelberg (2006). doi:10.1007/11691372_6

    Chapter  Google Scholar 

  27. Sloan, S.W.: An algorithm for profile and wavefront reduction of sparse matrices. Int. J. Numer. Meth. Eng. 23(2), 239–251 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  28. Van Dongen, S.: A cluster algorithm for graphs. Inform. Syst. 10, 1–40 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Torino, Turin, Italy

    Elvio Gilberto Amparore, Marco Beccuti & Susanna Donatelli

Authors
  1. Elvio Gilberto Amparore
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marco Beccuti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Susanna Donatelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Elvio Gilberto Amparore .

Editor information

Editors and Affiliations

  1. Indian Institute of Science, Bangalore, India

    Deepak D'Souza

  2. Chennai Mathematical Institute, Kelambakkam, India

    K. Narayan Kumar

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Amparore, E.G., Beccuti, M., Donatelli, S. (2017). Gradient-Based Variable Ordering of Decision Diagrams for Systems with Structural Units. In: D'Souza, D., Narayan Kumar, K. (eds) Automated Technology for Verification and Analysis. ATVA 2017. Lecture Notes in Computer Science(), vol 10482. Springer, Cham. https://doi.org/10.1007/978-3-319-68167-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-68167-2_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-68166-5

  • Online ISBN: 978-3-319-68167-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation