{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:03:40Z","timestamp":1762459420357},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662534007"},{"type":"electronic","value":"9783662534014"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53401-4_13","type":"book-chapter","created":{"date-parts":[[2016,9,2]],"date-time":"2016-09-02T15:34:52Z","timestamp":1472830492000},"page":"274-285","source":"Crossref","is-referenced-by-count":7,"title":["Running LoLA 2.0 in a Model Checking Competition"],"prefix":"10.1007","author":[{"given":"Karsten","family":"Wolf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,2]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/3-540-44919-1_31","volume-title":"Applications and Theory of Petri Nets 2003","author":"J Billington","year":"2003","unstructured":"Billington, J., et al.: The Petri Net Markup Language: concepts, technology, and tools. In: Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol. 2679, pp. 483\u2013505. Springer, Heidelberg (2003)"},{"issue":"7","key":"13_CR2","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"issue":"3","key":"13_CR3","doi-asserted-by":"crossref","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."},{"issue":"2","key":"13_CR4","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"JR Burch","year":"1992","unstructured":"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\u2013170 (1992)","journal-title":"Inf. Comput."},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/3-540-45319-9_31","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Christensen","year":"2001","unstructured":"Christensen, S., Kristensen, L.M., Mailund, T.: A sweep-line method for state space exploration. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 450\u2013464. Springer, Heidelberg (2001)"},{"issue":"1","key":"13_CR6","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1011276507260","volume":"19","author":"EM Clarke","year":"2001","unstructured":"Clarke, E.M., Biere, A., Raimi, R., Zhu, Y.: Bounded model checking using satisfiability solving. Formal Methods Syst. Des. 19(1), 7\u201334 (2001)","journal-title":"Formal Methods Syst. Des."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Das, D., Chakrabarti, P.P., Kumar, R.: Functional verification of task partitioning for multiprocessor embedded systems. ACM Trans. Des. Autom. Electr. Syst., 12(4) (2007)","DOI":"10.1145\/1278349.1278357"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1007\/978-3-642-28756-5_36","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A David","year":"2012","unstructured":"David, A., Jacobsen, L., Jacobsen, M., J\u00f8rgensen, K.Y., M\u00f8ller, M.H., Srba, J.: TAPAAL 2.0: integrated development environment for timed-arc Petri nets. In: Flanagan, C., K\u00f6nig, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 492\u2013497. Springer, Heidelberg (2012)"},{"key":"13_CR9","unstructured":"Kordon, F., et al.: The MCC web page. http:\/\/mcc.lip6.fr"},{"issue":"5","key":"13_CR10","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/j.datak.2011.01.004","volume":"70","author":"D Fahland","year":"2011","unstructured":"Fahland, D., Favre, C., Koehler, J., Lohmann, N., V\u00f6lzer, H., Wolf, K.: Analysis on demand: instantaneous soundness checking of industrial business process models. Data Knowl. Eng. 70(5), 448\u2013466 (2011)","journal-title":"Data Knowl. Eng."},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-38697-8_21","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"M Heiner","year":"2013","unstructured":"Heiner, M., Rohr, C., Schwarick, M.: MARCIE \u2013 model checking and reachability analysis done efficiently. In: Colom, J.-M., Desel, J. (eds.) PETRI NETS 2013. LNCS, vol. 7927, pp. 389\u2013399. Springer, Heidelberg (2013)"},{"issue":"3","key":"13_CR12","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0304-3975(86)90046-0","volume":"45","author":"P Huber","year":"1986","unstructured":"Huber, P., Jensen, A.M., Jepsen, L.O., Jensen, K.: Reachability trees for high-level Petri nets. Theor. Comput. Sci. 45(3), 261\u2013292 (1986)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"13_CR13","first-page":"307","volume":"7","author":"TA Junttila","year":"2001","unstructured":"Junttila, T.A.: Computational complexity of the place\/transition-net symmetry reduction method. J. UCS 7(4), 307\u2013326 (2001)","journal-title":"J. UCS"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1007\/978-3-642-14295-6_55","volume-title":"Computer Aided Verification","author":"A Kaiser","year":"2010","unstructured":"Kaiser, A., Kroening, D., Wahl, T.: Dynamic cutoff detection in parameterized concurrent programs. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 645\u2013659. Springer, Heidelberg (2010)"},{"key":"13_CR15","unstructured":"Kordon, F.: Report from MCC at PETRI NETS (2014)"},{"key":"13_CR16","unstructured":"Kordon, F.: Report from MCC at PETRI NETS (2015)"},{"issue":"3","key":"13_CR17","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s10703-006-0006-1","volume":"29","author":"LM Kristensen","year":"2006","unstructured":"Kristensen, L.M., Schmidt, K., Valmari, A.: Question-guided stubborn set methods for state properties. Formal Methods Syst. Des. 29(3), 215\u2013251 (2006)","journal-title":"Formal Methods Syst. Des."},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/978-3-540-79230-7_4","volume-title":"Web Services and Formal Methods","author":"N Lohmann","year":"2008","unstructured":"Lohmann, N., Kopp, O., Leymann, F., Reisig, W.: Analyzing BPEL4Chor: verification and participant synthesis. In: Dumas, M., Heckel, R. (eds.) WS-FM 2007. LNCS, vol. 4937, pp. 46\u201360. Springer, Heidelberg (2008)"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/978-3-642-13675-7_16","volume-title":"Applications and Theory of Petri Nets","author":"O Oanea","year":"2010","unstructured":"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\u2013286. Springer, Heidelberg (2010)"},{"issue":"7","key":"13_CR20","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s002360050002","volume":"36","author":"K Schmidt","year":"2000","unstructured":"Schmidt, K.: How to calculate symmetries of Petri nets. Acta Inf. 36(7), 545\u2013590 (2000)","journal-title":"Acta Inf."},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/3-540-46419-0_22","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K Schmidt","year":"2000","unstructured":"Schmidt, K.: Integrating low level symmetries into reachability analysis. In: Graf, S. (ed.) TACAS 2000. LNCS, vol. 1785, pp. 315\u2013330. Springer, Heidelberg (2000)"},{"issue":"3","key":"13_CR22","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10009-005-0201-1","volume":"8","author":"K Schmidt","year":"2006","unstructured":"Schmidt, K.: Automated generation of a progress measure for the sweep-line method. STTT 8(3), 195\u2013203 (2006)","journal-title":"STTT"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Stahl, C., Reisig, W., Krstic, M.: Hazard detection in a GALS wrapper: a case study. In: Proceedings of ACSD. IEEE (2005)","DOI":"10.1109\/ACSD.2005.20"},{"key":"13_CR24","unstructured":"Talcott, C., Dill, D.L.: The pathway logic assistant. In: Proceedings of Computational Methods in Systems Biology (2005)"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","first-page":"491","volume-title":"Advances in Petri Nets 1990","author":"A Valmari","year":"1989","unstructured":"Valmari, A.: Stubborn sets for reduced state space generation. In: Rozenberg, G. (ed.) Advances in Petri Nets 1990. LNCS, vol. 483, pp. 491\u2013515. Springer, Heidelberg (1989)"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Wimmel, H., Wolf, K.: Applying CEGAR to the Petri net state equation. Logical Meth. Comput. Sci. 8(3) (2012)","DOI":"10.2168\/LMCS-8(3:27)2012"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-3-540-73094-1_5","volume-title":"Petri Nets and Other Models of Concurrency \u2013 ICATPN 2007","author":"K Wolf","year":"2007","unstructured":"Wolf, K.: Generating Petri net state spaces. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 29\u201342. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Petri Nets and Other Models of Concurrency XI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53401-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T04:48:43Z","timestamp":1568350123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53401-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662534007","9783662534014"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53401-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}