{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:49:37Z","timestamp":1743144577782,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031726200"},{"type":"electronic","value":"9783031726217"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-72621-7_3","type":"book-chapter","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T07:02:34Z","timestamp":1726729354000},"page":"21-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing Reachable Simulations on\u00a0Transition Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3625-6003","authenticated-orcid":false,"given":"Pierre","family":"Ganty","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7561-3763","authenticated-orcid":false,"given":"Nicolas","family":"Manini","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0159-0068","authenticated-orcid":false,"given":"Francesco","family":"Ranzato","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,18]]},"reference":[{"key":"3_CR1","unstructured":"Alur, R., Henzinger, T.A.: Computer-Aided Verification (1999). chapter 4: Graph minimization (Unpublished manuscript)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-56496-9_21","volume-title":"Computer Aided Verification","author":"S Bensalem","year":"1993","unstructured":"Bensalem, S., Bouajjani, A., Loiseaux, C., Sifakis, J.: Property preserving simulations. In: von Bochmann, G., Probst, D.K. (eds.) CAV 1992. LNCS, vol. 663, pp. 260\u2013273. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56496-9_21"},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0167-6423(95)00003-B","volume":"24","author":"B Bloom","year":"1995","unstructured":"Bloom, B., Paige, R.: Transformational design and implementation of a new efficient solution to the ready simulation problem. Sci. Comput. Program. 24(3), 189\u2013220 (1995). https:\/\/doi.org\/10.1016\/0167-6423(95)00003-B","journal-title":"Sci. Comput. Program."},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/BFb0023733","volume-title":"Computer-Aided Verification","author":"A Bouajjani","year":"1991","unstructured":"Bouajjani, A., Fernandez, J.-C., Halbwachs, N.: Minimal model generation. In: Clarke, E.M., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol. 531, pp. 197\u2013203. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0023733"},{"issue":"3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0167-6423(92)90018-7","volume":"18","author":"A Bouajjani","year":"1992","unstructured":"Bouajjani, A., Fernandez, J.C., Halbwachs, N., Raymond, P., Ratel, C.: Minimal state graph generation. Sci. Comput. Program. 18(3), 247\u2013269 (1992). https:\/\/doi.org\/10.1016\/0167-6423(92)90018-7","journal-title":"Sci. Comput. Program."},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/635499.635502","volume":"4","author":"D Bustan","year":"2003","unstructured":"Bustan, D., Grumberg, O.: Simulation-based minimization. ACM Trans. Comput. Log. 4(2), 181\u2013206 (2003). https:\/\/doi.org\/10.1145\/635499.635502","journal-title":"ACM Trans. Comput. Log."},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"C\u00e9c\u00e9, G.: Foundation for a series of efficient simulation algorithms. In: Proceedings of the 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2017, pp. 1\u201312. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/LICS.2017.8005069","DOI":"10.1109\/LICS.2017.8005069"},{"key":"3_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10575-8","volume-title":"Handbook of Model Checking","author":"EM Clarke","year":"2018","unstructured":"Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R.: Handbook of Model Checking, 1st edn. Springer, Cham (2018)","edition":"1"},{"issue":"1\u20132","key":"3_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.3233\/FI-2011-412","volume":"108","author":"S Crafa","year":"2011","unstructured":"Crafa, S., Ranzato, F., Tapparo, F.: Saving space in a time efficient simulation algorithm. Fundam. Informaticae 108(1\u20132), 23\u201342 (2011). https:\/\/doi.org\/10.3233\/FI-2011-412","journal-title":"Fundam. Informaticae"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/A:1016091902809","volume":"21","author":"K Fisler","year":"2002","unstructured":"Fisler, K., Vardi, M.Y.: Bisimulation minimization and symbolic model checking. Formal Methods Syst. Des. 21(1), 39\u201378 (2002). https:\/\/doi.org\/10.1023\/A:1016091902809","journal-title":"Formal Methods Syst. Des."},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1023\/A:1027328830731","volume":"31","author":"R Gentilini","year":"2003","unstructured":"Gentilini, R., Piazza, C., Policriti, A.: From bisimulation to simulation: coarsest partition problems. J. Autom. Reason. 31(1), 73\u2013103 (2003). https:\/\/doi.org\/10.1023\/A:1027328830731","journal-title":"J. Autom. Reason."},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-540-70545-1_49","volume-title":"Computer Aided Verification","author":"R van Glabbeek","year":"2008","unstructured":"van Glabbeek, R., Ploeger, B.: Correcting a space-efficient simulation algorithm. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 517\u2013529. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70545-1_49"},{"key":"3_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-0018-1","volume-title":"Lattice Theory: Foundation","author":"GA Gratzer","year":"2011","unstructured":"Gratzer, G.A.: Lattice Theory: Foundation. Springer, Basel (2011)"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-54430-5_93","volume-title":"CONCUR \u201991","author":"O Grumberg","year":"1991","unstructured":"Grumberg, O., Long, D.E.: Model checking and modular verification. In: Baeten, J.C.M., Groote, J.F. (eds.) CONCUR 1991. LNCS, vol. 527, pp. 250\u2013265. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54430-5_93"},{"issue":"3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/177492.177725","volume":"16","author":"O Grumberg","year":"1994","unstructured":"Grumberg, O., Long, D.E.: Model checking and modular verification. ACM Trans. Program. Lang. Syst. (TOPLAS) 16(3), 843\u2013871 (1994). https:\/\/doi.org\/10.1145\/177492.177725","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Gulavani, B.S., Henzinger, T.A., Kannan, Y., Nori, A.V., Rajamani, S.K.: SYNERGY: a new algorithm for property checking. In: Proceedings of the 14th ACM SIGSOFT International Symposium on Foundations of Software Engineering, FSE 2006, pp. 117\u2013127. ACM (2006). https:\/\/doi.org\/10.1145\/1181775.1181790","DOI":"10.1145\/1181775.1181790"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: Proceedings of IEEE 36th Annual Foundations of Computer Science, FOCS 1995, pp. 453\u2013462 (1995). https:\/\/doi.org\/10.1109\/SFCS.1995.492576","DOI":"10.1109\/SFCS.1995.492576"},{"key":"3_CR18","unstructured":"Henzinger, T.A., Kopke, P.W.: Hybrid automata with finite mutual simulations. Technical report, TR-95-1497, Computer Science Department (1995)"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-12(1:6)2016","volume":"12","author":"P Hofman","year":"2016","unstructured":"Hofman, P., Lasota, S., Mayr, R., Totzke, P.: Simulation problems over one-counter nets. Log. Methods Comput. Sci. 12, 1\u201346 (2016). https:\/\/doi.org\/10.2168\/LMCS-12(1:6)2016","journal-title":"Log. Methods Comput. Sci."},{"issue":"3","key":"3_CR20","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1017\/S1471068406002651","volume":"6","author":"A Ku\u010dera","year":"2006","unstructured":"Ku\u010dera, A., Jan\u010dar, P.: Equivalence-checking on infinite-state systems: techniques and results. Theory Pract. Log. Program. 6(3), 227\u2013264 (2006). https:\/\/doi.org\/10.1017\/S1471068406002651","journal-title":"Theory Pract. Log. Program."},{"issue":"2","key":"3_CR21","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1006\/inco.2001.3122","volume":"173","author":"A Kucera","year":"2002","unstructured":"Kucera, A., Mayr, R.: Simulation preorder over simple process algebras. Inf. Comput. 173(2), 184\u2013198 (2002). https:\/\/doi.org\/10.1006\/inco.2001.3122","journal-title":"Inf. Comput."},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/3-540-45694-5_39","volume-title":"CONCUR 2002 \u2014 Concurrency Theory","author":"A Ku\u010dera","year":"2002","unstructured":"Ku\u010dera, A., Mayr, R.: Why is simulation harder than bisimulation? In: Brim, L., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A., Jan\u010dar, P. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 594\u2013609. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45694-5_39"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Lee, D., Yannakakis, M.: Online minimization of transition systems. In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992, pp. 264\u2013274. ACM (1992). https:\/\/doi.org\/10.1145\/129712.129738","DOI":"10.1145\/129712.129738"},{"issue":"1","key":"3_CR24","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01384313","volume":"6","author":"C Loiseaux","year":"1995","unstructured":"Loiseaux, C., Graf, S., Sifakis, J., Bouajjani, A., Bensalem, S.: Property preserving abstractions for the verification of concurrent systems. Formal Methods Syst. Des. 6(1), 11\u201344 (1995). https:\/\/doi.org\/10.1007\/BF01384313","journal-title":"Formal Methods Syst. Des."},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Majumdar, R., Ozay, N., Schmuck, A.K.: On abstraction-based controller design with output feedback. In: Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control, HSCC 2020, pp. 1\u201311. ACM (2020). https:\/\/doi.org\/10.1145\/3365365.3382219","DOI":"10.1145\/3365365.3382219"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/11513988_7","volume-title":"Computer Aided Verification","author":"CS P\u0103s\u0103reanu","year":"2005","unstructured":"P\u0103s\u0103reanu, C.S., Pel\u00e1nek, R., Visser, W.: Concrete model checking with abstract matching and refinement. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 52\u201366. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11513988_7"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1007\/978-3-642-40313-2_66","volume-title":"Mathematical Foundations of Computer Science 2013","author":"F Ranzato","year":"2013","unstructured":"Ranzato, F.: A more efficient simulation algorithm on Kripke structures. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 753\u2013764. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40313-2_66"},{"issue":"2","key":"3_CR28","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s00236-014-0195-9","volume":"51","author":"F Ranzato","year":"2014","unstructured":"Ranzato, F.: An efficient simulation algorithm on Kripke structures. Acta Informatica 51(2), 107\u2013125 (2014). https:\/\/doi.org\/10.1007\/s00236-014-0195-9","journal-title":"Acta Informatica"},{"key":"3_CR29","doi-asserted-by":"publisher","unstructured":"Ranzato, F., Tapparo, F.: A new efficient simulation equivalence algorithm. In: Proceedings of the 22nd IEEE Symposium on Logic in Computer Science, LICS 2007, pp. 171\u2013180. IEEE Computer Society (2007). https:\/\/doi.org\/10.1109\/LICS.2007.8","DOI":"10.1109\/LICS.2007.8"},{"issue":"1","key":"3_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2009.06.002","volume":"208","author":"F Ranzato","year":"2010","unstructured":"Ranzato, F., Tapparo, F.: An efficient simulation algorithm based on abstract interpretation. Inf. Comput. 208(1), 1\u201322 (2010). https:\/\/doi.org\/10.1016\/j.ic.2009.06.002","journal-title":"Inf. Comput."},{"key":"3_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/3-540-45319-9_33","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Tan","year":"2001","unstructured":"Tan, L., Cleaveland, R.: Simulation revisited. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 480\u2013495. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45319-9_33"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-70844-5_17","volume-title":"Implementation and Applications of Automata","author":"R van Glabbeek","year":"2008","unstructured":"van Glabbeek, R., Ploeger, B.: Five determinisation algorithms. In: Ibarra, O.H., Ravikumar, B. (eds.) CIAA 2008. LNCS, vol. 5148, pp. 161\u2013170. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70844-5_17"},{"issue":"2","key":"3_CR33","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1023\/A:1008621829508","volume":"11","author":"M Yannakakis","year":"1997","unstructured":"Yannakakis, M., Lee, D.: An efficient algorithm for minimizing real-time transition systems: extended abstract. Formal Methods Syst. Des. 11(2), 113\u2013136 (1997). https:\/\/doi.org\/10.1023\/A:1008621829508","journal-title":"Formal Methods Syst. Des."}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-72621-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T07:06:02Z","timestamp":1726729562000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-72621-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031726200","9783031726217"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-72621-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"18 September 2024","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":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easychair.org\/smart-program\/RP24\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}