{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:42:20Z","timestamp":1743133340163,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030617387"},{"type":"electronic","value":"9783030617394"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-61739-4_3","type":"book-chapter","created":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T23:11:38Z","timestamp":1602717098000},"page":"37-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reachability Set Generation Using Hybrid Relation Compatible Saturation"],"prefix":"10.1007","author":[{"given":"Shruti","family":"Biswal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew S.","family":"Miner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,15]]},"reference":[{"key":"3_CR1","unstructured":"MCC: Model Checking Competition @ Petri Nets. \nhttps:\/\/mcc.lip6.fr"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Babar, J., Miner, A.S.: MEDDLY: multi-terminal and edge-valued decision diagram LibrarY. In: Proceedings of the QEST, pp. 195\u2013196. IEEE Computer Society (2010)","DOI":"10.1109\/QEST.2010.34"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-030-21571-2_17","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"S Biswal","year":"2019","unstructured":"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\u2013320. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-21571-2_17"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-45319-9_23","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Ciardo","year":"2001","unstructured":"Ciardo, G., L\u00fcttgen, G., Siminiceanu, R.: Saturation: an efficient iteration strategy for symbolic state\u2014space generation. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 328\u2013342. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-45319-9_23"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/3-540-36577-X_27","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Ciardo","year":"2003","unstructured":"Ciardo, G., Marmorstein, R., Siminiceanu, R.: Saturation unbound. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 379\u2013393. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/3-540-36577-X_27"},{"key":"3_CR6","unstructured":"Ciardo, G., Miner, A.S.: SMART: Stochastic Model checking Analyzer for Reliability and Timing, User Manual. \nhttp:\/\/smart.cs.iastate.edu"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/11560548_13","volume-title":"Correct Hardware Design and Verification Methods","author":"G Ciardo","year":"2005","unstructured":"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\u2013161. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11560548_13"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/3-540-48683-6_44","volume-title":"Computer Aided Verification","author":"A Cimatti","year":"1999","unstructured":"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\u2013499. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48683-6_44"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-48068-4_8","volume-title":"Application and Theory of Petri Nets 2002","author":"J-M Couvreur","year":"2002","unstructured":"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\u2013120. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-48068-4_8"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/11562436_32","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2005","author":"J-M Couvreur","year":"2005","unstructured":"Couvreur, J.-M., Thierry-Mieg, Y.: Hierarchical decision diagrams to exploit model structure. In: Wang, F. (ed.) FORTE 2005. LNCS, vol. 3731, pp. 443\u2013457. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11562436_32"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-68746-7_16","volume-title":"Applications and Theory of Petri Nets","author":"A Hamez","year":"2008","unstructured":"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\u2013230. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-68746-7_16"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Itai, A., Rodeh, M.: Symmetry breaking in distributed networks. In: 22th Annual Symposium on Foundations of Computer Science, pp. 150\u2013158. IEEE Computer Society Press, October 1981","DOI":"10.1109\/SFCS.1981.41"},{"issue":"1\u20132","key":"3_CR13","first-page":"9","volume":"4","author":"T Kam","year":"1998","unstructured":"Kam, T., Villa, T., Brayton, R.K., Sangiovanni-Vincentelli, A.: Multi-valued decision diagrams: theory and applications. Mult. Valued Log. 4(1\u20132), 9\u201362 (1998)","journal-title":"Mult. Valued Log."},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-319-57861-3_14","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"K Marussy","year":"2017","unstructured":"Marussy, K., Moln\u00e1r, V., V\u00f6r\u00f6s, 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\u2013242. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-57861-3_14"},{"key":"3_CR15","unstructured":"Minato, S.-i.: Zero-suppressed BDDs and their applications. Softw. Tools Technol. Transf. 3, 156\u2013170 (2001)"},{"issue":"8","key":"3_CR16","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1109\/TSE.2006.81","volume":"32","author":"AS Miner","year":"2006","unstructured":"Miner, A.S.: Saturation for a general class of models. IEEE Trans. Softw. Eng. 32(8), 559\u2013570 (2006)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-030-21571-2_19","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"V Moln\u00e1r","year":"2019","unstructured":"Moln\u00e1r, 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\u2013361. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-21571-2_19"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"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\u201310 (2018)","DOI":"10.1109\/ACSD.2018.000-4"},{"key":"3_CR19","unstructured":"Somenzi, F.: Binary decision diagrams. In: Calculational System Design. NATO Science Series F: Computer and Systems Sciences, vol. 173, pp. 303\u2013366. IOS Press (1999)"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1007\/978-3-540-95891-8_52","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"M Wan","year":"2009","unstructured":"Wan, M., Ciardo, G.: Symbolic state-space generation of asynchronous systems using extensible decision diagrams. In: Nielsen, M., Ku\u010dera, A., Miltersen, P.B., Palamidessi, C., T\u016fma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 582\u2013594. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-540-95891-8_52"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61739-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T23:30:00Z","timestamp":1602718200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61739-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030617387","9783030617394"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61739-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"15 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.irif.fr\/~rp2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}