Skip to main content
SpringerLink
Log in

Portfolio Management in Explicit Model Checking

  • Chapter
  • First Online:
Transactions on Petri Nets and Other Models of Concurrency XVI

Part of the book series: Lecture Notes in Computer Science ((TOPNOC,volume 13220))

  • 214 Accesses

Abstract

Thanks to a rich Petri net theory, there exists a broad range of verification techniques for Petri nets. Most of them have a performance that highly depends on the particular combination of net and property. That is why several verification tools for Petri nets use portfolio approaches where various verification algorithms are run concurrently.

In this note, we sketch the architecture of a portfolio manager, using the tool LoLA 2.0 as a running example. The portfolio of a verification problem is organized as a task tree. The leafs of the task tree are actual verification algorithms while the inner nodes represent the logical structure of the portfolio. The portfolio manager schedules verification algorithms and assigns resources to them (processor cores, memory, and time). Moreover, it evaluates the consequences of returned results with regard to the original 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
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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

References

  1. Berthelot, G.: Transformations and decompositions of nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 254, pp. 359–376. Springer, Heidelberg (1987). https://doi.org/10.1007/978-3-540-47919-2_13

    Chapter  Google Scholar 

  2. Bønneland, F., Dyhr, J., Jensen, P.G., Johannsen, M., Srba, J.: Simplification of CTL formulae for efficient model checking of Petri nets. In: Khomenko, V., Roux, O.H. (eds.) PETRI NETS 2018. LNCS, vol. 10877, pp. 143–163. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-91268-4_8

    Chapter  MATH  Google Scholar 

  3. Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 10\(^{20}\) states and beyond. Inf. Comput. 98(2), 142–170 (1992)

    Article  MathSciNet  Google Scholar 

  4. Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Program. Lang. Syst. 8(2), 244–263 (1986)

    Article  Google Scholar 

  5. David, A., Jacobsen, L., Jacobsen, M., Jørgensen, K.Y., Møller, M.H., Srba, J.: TAPAAL 2.0: integrated development environment for timed-arc Petri nets. In: Flanagan, C., König, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 492–497. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-28756-5_36

    Chapter  MATH  Google Scholar 

  6. Esparza, J., Heljanko, K.: Unfoldings - A Partial-Order Approach to Model Checking. Monographs in Theoretical Computer Science An EATCS Series, Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-77426-6

    Book  MATH  Google Scholar 

  7. Hack, M.H.T.: Analysis of production schemata by Petri nets. Master’s thesis, MIT, Department of Electrical Engineering, Cambridge, Massachusetts (1972)

    Google Scholar 

  8. Jensen, K.: Condensed state spaces for symmetrical coloured Petri nets. Formal Methods Syst. Des. 9(1/2), 7–40 (1996). https://doi.org/10.1007/BF00625967

    Article  Google Scholar 

  9. Kordon, F., et al.: Complete Results for the 2019 Edition of the Model Checking Contest, April 2019. http://mcc.lip6.fr/2019/results.php

  10. Kristensen, L.M., Schmidt, K., Valmari, A.: Question-guided stubborn set methods for state properties. Formal Methods Syst. Des. 29(3), 215–251 (2006). https://doi.org/10.1007/s10703-006-0006-1

    Article  MATH  Google Scholar 

  11. Liebke, T., Rosenke, C.: Faster enabledness-updates for the reachability graph computation. In: Proceedings of PNSE 2020, pp. 108–117 (2020)

    Google Scholar 

  12. Liebke, T., Wolf, K.: Taking some burden off an explicit CTL model checker. In: Donatelli, S., Haar, S. (eds.) PETRI NETS 2019. LNCS, vol. 11522, pp. 321–341. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-21571-2_18

    Chapter  Google Scholar 

  13. Lipton, R.: The reachability problem requires exponential space. Technical report 62, Yale University (1976)

    Google Scholar 

  14. Oanea, O., Wimmel, H., Wolf, K.: New algorithms for deciding the siphon-trap property. In: Lilius, J., Penczek, W. (eds.) PETRI NETS 2010. LNCS, vol. 6128, pp. 267–286. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13675-7_16

    Chapter  Google Scholar 

  15. Schmidt, K.: How to calculate symmetries of Petri nets. Acta Informatica 36(7), 545–590 (2000). https://doi.org/10.1007/s002360050002

    Article  MathSciNet  MATH  Google Scholar 

  16. Shatz, S.M., Tu, S., Murata, T., Duri, S.: An application of Petri net reduction for Ada tasking deadlock analysis. IEEE Trans. Parallel Distrib. Syst. 7(12), 1307–1322 (1996)

    Article  Google Scholar 

  17. Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146–160 (1972)

    Article  MathSciNet  Google Scholar 

  18. Thierry-Mieg, Y.: Symbolic model-checking using ITS-tools. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 231–237. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-46681-0_20

    Chapter  Google Scholar 

  19. Tovchigrechko, A.A.: Efficient symbolic analysis of bounded Petri nets using interval decision diagrams. Ph.D. thesis, Brandenburg University of Technology, Cottbus - Senftenberg, Germany (2008)

    Google Scholar 

  20. Valmari, A.: Stubborn sets for reduced state space generation. In: Rozenberg, G. (ed.) ICATPN 1989. LNCS, vol. 483, pp. 491–515. Springer, Heidelberg (1991). https://doi.org/10.1007/3-540-53863-1_36

    Chapter  Google Scholar 

  21. Valmari, A., Hansen, H.: Stubborn set intuition explained. In: Koutny, M., Kleijn, J., Penczek, W. (eds.) Transactions on Petri Nets and Other Models of Concurrency XII. LNCS, vol. 10470, pp. 140–165. Springer, Heidelberg (2017). https://doi.org/10.1007/978-3-662-55862-1_7

    Chapter  Google Scholar 

  22. Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification (preliminary report). In: Proceedings of the Symposium on Logic in Computer Science. LICS, IEEE, pp. 332–344 (1986)

    Google Scholar 

  23. Vergauwen, B., Lewi, J.: A linear local model checking algorithm for CTL. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 447–461. Springer, Heidelberg (1993). https://doi.org/10.1007/3-540-57208-2_31

    Chapter  Google Scholar 

  24. Williams, P.F., Biere, A., Clarke, E.M., Gupta, A.: Combining decision diagrams and SAT procedures for efficient symbolic model checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 124–138. Springer, Heidelberg (2000). https://doi.org/10.1007/10722167_13

    Chapter  Google Scholar 

  25. Wimmel, H., Wolf, K.: Applying CEGAR to the Petri net state equation. Log. Methods Comput. Sci. 8(3), 1–15 (2012)

    MathSciNet  MATH  Google Scholar 

  26. Wolf, K.: Running LoLA 2.0 in a model checking competition. In: Koutny, M., Desel, J., Kleijn, J. (eds.) Transactions on Petri Nets and Other Models of Concurrency XI. LNCS, vol. 9930, pp. 274–285. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53401-4_13

    Chapter  Google Scholar 

  27. Wolf, K.: Petri net model checking with LoLA 2. In: Khomenko, V., Roux, O.H. (eds.) PETRI NETS 2018. LNCS, vol. 10877, pp. 351–362. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-91268-4_18

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Rostock, Rostock, Germany

    Karsten Wolf

Authors
  1. Karsten Wolf
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Karsten Wolf .

Editor information

Editors and Affiliations

  1. Newcastle University, Newcastle upon Tyne, UK

    Maciej Koutny

  2. Sorbonne Université, Paris, France

    Fabrice Kordon

  3. Universität Hamburg, Hamburg, Germany

    Daniel Moldt

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer-Verlag GmbH Germany, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Wolf, K. (2022). Portfolio Management in Explicit Model Checking. In: Koutny, M., Kordon, F., Moldt, D. (eds) Transactions on Petri Nets and Other Models of Concurrency XVI. Lecture Notes in Computer Science(), vol 13220. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-65303-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-65303-6_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-65302-9

  • Online ISBN: 978-3-662-65303-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation