{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:58:20Z","timestamp":1743037100768,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030215705"},{"type":"electronic","value":"9783030215712"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-21571-2_17","type":"book-chapter","created":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T23:04:17Z","timestamp":1560207857000},"page":"301-320","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improving Saturation Efficiency with Implicit Relations"],"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":[[2019,5,31]]},"reference":[{"key":"17_CR1","unstructured":"MCC: Model Checking Competition @ Petri Nets. https:\/\/mcc.lip6.fr"},{"key":"17_CR2","unstructured":"MEDDLY webpage. https:\/\/sourceforge.net\/projects\/meddly\/"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Babar, J., Miner, A.S.: Meddly: multi-terminal and Edge-valued Decision Diagram LibrarY. In: Proceedings of QEST, pp. 195\u2013196. IEEE Computer Society (2010)","DOI":"10.1109\/QEST.2010.34"},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"RE Bryant","year":"1992","unstructured":"Bryant, R.E.: Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surv. 24(3), 293\u2013318 (1992)","journal-title":"ACM Comput. Surv."},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/11901914_7","volume-title":"Automated Technology for Verification and Analysis","author":"M-Y Chung","year":"2006","unstructured":"Chung, M.-Y., Ciardo, G., Yu, A.J.: A fine-grained fullness-guided chaining heuristic for symbolic reachability analysis. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol. 4218, pp. 51\u201366. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11901914_7"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10703-006-0033-y","volume":"31","author":"G Ciardo","year":"2007","unstructured":"Ciardo, G., L\u00fcttgen, G., Miner, A.S.: Exploiting interleaving semantics in symbolic state-space generation. Form. Methods Syst. Des. 31, 63\u2013100 (2007)","journal-title":"Form. Methods Syst. Des."},{"key":"17_CR7","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). https:\/\/doi.org\/10.1007\/3-540-45319-9_23"},{"key":"17_CR8","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). https:\/\/doi.org\/10.1007\/3-540-36577-X_27"},{"key":"17_CR9","unstructured":"Ciardo, G., Miner, A.S.: SMART: simulation and Markovian analyzer for reliability and timing. In: Proceedings of IEEE International Computer Performance and Dependability Symposium (IPDS 1996), p. 60. IEEE Computer Society Press (1996)"},{"key":"17_CR10","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). https:\/\/doi.org\/10.1007\/11560548_13"},{"key":"17_CR11","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). https:\/\/doi.org\/10.1007\/3-540-48068-4_8"},{"key":"17_CR12","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). https:\/\/doi.org\/10.1007\/11562436_32"},{"issue":"1\u20132","key":"17_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."},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.peva.2003.07.005","volume":"56","author":"AS Miner","year":"2004","unstructured":"Miner, A.S.: Implicit GSPN reachability set generation using decision diagrams. Perform. Eval. 56(1), 145\u2013165 (2004). Dependable Systems and Networks - Performance and Dependability Symposium (DSN-PDS) 2002: Selected Papers","journal-title":"Perform. Eval."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Miner, A.S.: Saturation for a general class of models. In: Proceedings of QEST, pp. 282\u2013291, September 2004","DOI":"10.1109\/QEST.2004.1348042"},{"issue":"4","key":"17_CR16","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541\u2013579 (1989)","journal-title":"Proc. IEEE"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Strehl, K., Thiele, L.: Interval diagram techniques for symbolic model checking of Petri nets. In: Proceedings of Design, Automation and Test in Europe (DATE 1999), pp. 756\u2013757, March 1999","DOI":"10.1145\/307418.307452"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-662-46681-0_20","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y Thierry-Mieg","year":"2015","unstructured":"Thierry-Mieg, Y.: Symbolic model-checking using ITS-tools. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 231\u2013237. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46681-0_20"},{"key":"17_CR19","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). https:\/\/doi.org\/10.1007\/978-3-540-95891-8_52"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/BFb0031826","volume-title":"Formal Methods in Computer-Aided Design","author":"T Yoneda","year":"1996","unstructured":"Yoneda, T., Hatori, H., Takahara, A., Minato, S.: BDDs vs. Zero-suppressed BDDs: for CTL symbolic model checking of Petri nets. In: Srivas, M., Camilleri, A. (eds.) FMCAD 1996. LNCS, vol. 1166, pp. 435\u2013449. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0031826"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21571-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:00:44Z","timestamp":1710248444000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21571-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030215705","9783030215712"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21571-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"31 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PETRI NETS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applications and Theory of Petri Nets and Concurrency","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aachen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.petrinets2019.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}