Skip to main content
SpringerLink
Log in

Reachability Set Generation Using Hybrid Relation Compatible Saturation

  • Conference paper
  • First Online:
Reachability Problems (RP 2020)

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

Included in the following conference series:

  • 208 Accesses

Abstract

Generating the state space of any finite discrete-state system using symbolic algorithms like saturation requires the use of decision diagrams or compatible structures for encoding its reachability set and transition relations. For systems that can be formally expressed using ordinary Petri Nets (PN), implicit relations, a static alternative to decision diagram-based representation of transition relations, can significantly improve the performance of saturation. However, in practice, some systems require more general models, such as self-modifying Petri nets, which cannot currently utilize implicit relations and thus use decision diagrams that are repeatedly rebuilt to accommodate the changing bounds of the system variables, potentially leading to overhead in saturation algorithm. This work introduces a hybrid representation for transition relations, that combines decision diagrams and implicit relations, to reduce the rebuilding overheads of the saturation algorithm for a general class of models. Experiments on several benchmark models across different tools demonstrate the efficiency of this representation.

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

References

  1. MCC: Model Checking Competition @ Petri Nets. https://mcc.lip6.fr

  2. Babar, J., Miner, A.S.: MEDDLY: multi-terminal and edge-valued decision diagram LibrarY. In: Proceedings of the QEST, pp. 195–196. IEEE Computer Society (2010)

    Google Scholar 

  3. Biswal, S., Miner, A.S.: Improving saturation efficiency with implicit relations. In: Donatelli, S., Haar, S. (eds.) PETRI NETS 2019. LNCS, vol. 11522, pp. 301–320. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-21571-2_17

    Chapter  Google Scholar 

  4. 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). https://doi.org/10.1007/3-540-45319-9_23

    Chapter  MATH  Google Scholar 

  5. Ciardo, G., Marmorstein, R., Siminiceanu, R.: Saturation unbound. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 379–393. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-36577-X_27

    Chapter  Google Scholar 

  6. Ciardo, G., Miner, A.S.: SMART: Stochastic Model checking Analyzer for Reliability and Timing, User Manual. http://smart.cs.iastate.edu

  7. Ciardo, G., Yu, A.J.: Saturation-based symbolic reachability analysis using conjunctive and disjunctive partitioning. In: Borrione, D., Paul, W. (eds.) CHARME 2005. LNCS, vol. 3725, pp. 146–161. Springer, Heidelberg (2005). https://doi.org/10.1007/11560548_13

    Chapter  Google Scholar 

  8. Cimatti, A., Clarke, E., Giunchiglia, F., Roveri, M.: NuSMV: a new symbolic model verifier. In: Halbwachs, N., Peled, D. (eds.) CAV 1999. LNCS, vol. 1633, pp. 495–499. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48683-6_44

    Chapter  Google Scholar 

  9. Couvreur, J.-M., Encrenaz, E., Paviot-Adet, E., Poitrenaud, D., Wacrenier, P.-A.: Data decision diagrams for Petri Net analysis. In: Esparza, J., Lakos, C. (eds.) ICATPN 2002. LNCS, vol. 2360, pp. 101–120. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-48068-4_8

    Chapter  MATH  Google Scholar 

  10. Couvreur, J.-M., Thierry-Mieg, Y.: Hierarchical decision diagrams to exploit model structure. In: Wang, F. (ed.) FORTE 2005. LNCS, vol. 3731, pp. 443–457. Springer, Heidelberg (2005). https://doi.org/10.1007/11562436_32

    Chapter  Google Scholar 

  11. Hamez, A., Thierry-Mieg, Y., Kordon, F.: Hierarchical set decision diagrams and automatic saturation. In: van Hee, K.M., Valk, R. (eds.) PETRI NETS 2008. LNCS, vol. 5062, pp. 211–230. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-68746-7_16

    Chapter  MATH  Google Scholar 

  12. Itai, A., Rodeh, M.: Symmetry breaking in distributed networks. In: 22th Annual Symposium on Foundations of Computer Science, pp. 150–158. IEEE Computer Society Press, October 1981

    Google Scholar 

  13. Kam, T., Villa, T., Brayton, R.K., Sangiovanni-Vincentelli, A.: Multi-valued decision diagrams: theory and applications. Mult. Valued Log. 4(1–2), 9–62 (1998)

    MathSciNet  MATH  Google Scholar 

  14. Marussy, K., Molnár, V., Vörös, A., Majzik, I.: Getting the priorities right: saturation for prioritised Petri Nets. In: van der Aalst, W., Best, E. (eds.) PETRI NETS 2017. LNCS, vol. 10258, pp. 223–242. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-57861-3_14

    Chapter  MATH  Google Scholar 

  15. Minato, S.-i.: Zero-suppressed BDDs and their applications. Softw. Tools Technol. Transf. 3, 156–170 (2001)

    Google Scholar 

  16. Miner, A.S.: Saturation for a general class of models. IEEE Trans. Softw. Eng. 32(8), 559–570 (2006)

    Article  Google Scholar 

  17. Molnár, V., Majzik, I.: Saturation enhanced with conditional locality: application to Petri Nets. In: Donatelli, S., Haar, S. (eds.) PETRI NETS 2019. LNCS, vol. 11522, pp. 342–361. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-21571-2_19

    Chapter  Google Scholar 

  18. Smith, B., Ciardo, G.: SOUPS: a variable ordering metric for the saturation algorithm. In: 2018 18th International Conference on Application of Concurrency to System Design (ACSD), pp. 1–10 (2018)

    Google Scholar 

  19. Somenzi, F.: Binary decision diagrams. In: Calculational System Design. NATO Science Series F: Computer and Systems Sciences, vol. 173, pp. 303–366. IOS Press (1999)

    Google Scholar 

  20. Wan, M., Ciardo, G.: Symbolic state-space generation of asynchronous systems using extensible decision diagrams. In: Nielsen, M., Kučera, A., Miltersen, P.B., Palamidessi, C., Tůma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 582–594. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-540-95891-8_52

    Chapter  MATH  Google Scholar 

Download references

Acknowledgment

This work was supported in part by the National Science Foundation under grant ACI-1642327.

Author information

Authors and Affiliations

  1. Iowa State University, Ames, IA, 50011, USA

    Shruti Biswal & Andrew S. Miner

Authors
  1. Shruti Biswal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew S. Miner
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shruti Biswal .

Editor information

Editors and Affiliations

  1. Université de Paris, Paris, France

    Sylvain Schmitz

  2. University of Liverpool, Liverpool, UK

    Igor Potapov

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Biswal, S., Miner, A.S. (2020). Reachability Set Generation Using Hybrid Relation Compatible Saturation. In: Schmitz, S., Potapov, I. (eds) Reachability Problems. RP 2020. Lecture Notes in Computer Science(), vol 12448. Springer, Cham. https://doi.org/10.1007/978-3-030-61739-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-61739-4_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-61738-7

  • Online ISBN: 978-3-030-61739-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation