{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T21:08:12Z","timestamp":1776373692992,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-18-CE40-0015"],"award-info":[{"award-number":["ANR-18-CE40-0015"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,2]]},"DOI":"10.1145\/3531130.3533343","type":"proceedings-article","created":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T20:23:38Z","timestamp":1659644618000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods"],"prefix":"10.1145","author":[{"given":"R.","family":"Govind","sequence":"first","affiliation":[{"name":"Dept. of Computer Science and Engineering, IIT Bombay, India"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Herbreteau","sequence":"additional","affiliation":[{"name":"Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR5800, F-33400 Talence, France, France"}]},{"family":"Srivathsan","sequence":"additional","affiliation":[{"name":"Chennai Mathematical Institute, India"}]},{"given":"Igor","family":"Walukiewicz","sequence":"additional","affiliation":[{"name":"Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR5800, F-33400 Talence, France, France"}]}],"member":"320","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535845"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3073408"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"e_1_3_2_1_4_1","volume-title":"USA","author":"Audemard Gilles","year":"2002","unstructured":"Gilles Audemard , Alessandro Cimatti , Artur Kornilowicz , and Roberto Sebastiani . 2002 . Bounded Model Checking for Timed Systems. In Formal Techniques for Networked and Distributed Systems - FORTE 2002, 22nd IFIP WG 6.1 International Conference Houston, Texas , USA , November 11-14, 2002, Proceedings(Lecture Notes in Computer Science, Vol.\u00a02529), Doron\u00a0A. Peled and Moshe\u00a0Y. Vardi (Eds.). Springer, 243\u2013259. https:\/\/doi.org\/10.1007\/3-540-36135-9_16 10.1007\/3-540-36135-9_16 Gilles Audemard, Alessandro Cimatti, Artur Kornilowicz, and Roberto Sebastiani. 2002. Bounded Model Checking for Timed Systems. In Formal Techniques for Networked and Distributed Systems - FORTE 2002, 22nd IFIP WG 6.1 International Conference Houston, Texas, USA, November 11-14, 2002, Proceedings(Lecture Notes in Computer Science, Vol.\u00a02529), Doron\u00a0A. Peled and Moshe\u00a0Y. Vardi (Eds.). Springer, 243\u2013259. https:\/\/doi.org\/10.1007\/3-540-36135-9_16"},{"key":"e_1_3_2_1_5_1","volume-title":"FORMATS 2011, Aalborg, Denmark, September 21-23, 2011. Proceedings(Lecture Notes in Computer Science, Vol.\u00a06919)","author":"Badban Bahareh","year":"2011","unstructured":"Bahareh Badban and Martin Lange . 2011 . Exact Incremental Analysis of Timed Automata with an SMT-Solver. In Formal Modeling and Analysis of Timed Systems - 9th International Conference , FORMATS 2011, Aalborg, Denmark, September 21-23, 2011. Proceedings(Lecture Notes in Computer Science, Vol.\u00a06919) , Uli Fahrenberg and Stavros Tripakis (Eds.). Springer, 177\u2013192. https:\/\/doi.org\/10.1007\/978-3-642-24310-3_13 10.1007\/978-3-642-24310-3_13 Bahareh Badban and Martin Lange. 2011. Exact Incremental Analysis of Timed Automata with an SMT-Solver. In Formal Modeling and Analysis of Timed Systems - 9th International Conference, FORMATS 2011, Aalborg, Denmark, September 21-23, 2011. Proceedings(Lecture Notes in Computer Science, Vol.\u00a06919), Uli Fahrenberg and Stavros Tripakis (Eds.). Springer, 177\u2013192. https:\/\/doi.org\/10.1007\/978-3-642-24310-3_13"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/3220880.3220966"},{"key":"e_1_3_2_1_7_1","volume-title":"11th International Conference, CAV \u201999, Trento, Italy, July 6-10, 1999, Proceedings(Lecture Notes in Computer Science, Vol.\u00a01633)","author":"Behrmann Gerd","year":"1999","unstructured":"Gerd Behrmann , Kim\u00a0Guldstrand Larsen , Justin Pearson , Carsten Weise , and Wang Yi . 1999 . Efficient Timed Reachability Analysis Using Clock Difference Diagrams. In Computer Aided Verification , 11th International Conference, CAV \u201999, Trento, Italy, July 6-10, 1999, Proceedings(Lecture Notes in Computer Science, Vol.\u00a01633) , Nicolas Halbwachs and Doron\u00a0A. Peled (Eds.). Springer, 341\u2013353. https:\/\/doi.org\/10.1007\/3-540-48683-6_30 10.1007\/3-540-48683-6_30 Gerd Behrmann, Kim\u00a0Guldstrand Larsen, Justin Pearson, Carsten Weise, and Wang Yi. 1999. Efficient Timed Reachability Analysis Using Clock Difference Diagrams. In Computer Aided Verification, 11th International Conference, CAV \u201999, Trento, Italy, July 6-10, 1999, Proceedings(Lecture Notes in Computer Science, Vol.\u00a01633), Nicolas Halbwachs and Doron\u00a0A. Peled (Eds.). Springer, 341\u2013353. https:\/\/doi.org\/10.1007\/3-540-48683-6_30"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Johan Bengtsson Bengt Jonsson Johan Lilius and Wang Yi. 1998. Partial Order Reductions for Timed Systems. In CONCUR(Lecture Notes in Computer Science Vol.\u00a01466). 485\u2013500.  Johan Bengtsson Bengt Jonsson Johan Lilius and Wang Yi. 1998. Partial Order Reductions for Timed Systems. In CONCUR(Lecture Notes in Computer Science Vol.\u00a01466). 485\u2013500.","DOI":"10.1007\/BFb0055643"},{"key":"e_1_3_2_1_9_1","volume-title":"CAV 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings, Part I(Lecture Notes in Computer Science, Vol.\u00a010981)","author":"B\u00f8nneland M.","year":"2018","unstructured":"Frederik\u00a0 M. B\u00f8nneland , Peter\u00a0Gj\u00f8l Jensen , Kim\u00a0Guldstrand Larsen , Marco Mu\u00f1iz , and Jir\u00ed Srba . 2018 . Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems. In Computer Aided Verification - 30th International Conference , CAV 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings, Part I(Lecture Notes in Computer Science, Vol.\u00a010981) , Hana Chockler and Georg Weissenbacher (Eds.). Springer, 527\u2013546. https:\/\/doi.org\/10.1007\/978-3-319-96145-3_28 10.1007\/978-3-319-96145-3_28 Frederik\u00a0M. B\u00f8nneland, Peter\u00a0Gj\u00f8l Jensen, Kim\u00a0Guldstrand Larsen, Marco Mu\u00f1iz, and Jir\u00ed Srba. 2018. Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems. In Computer Aided Verification - 30th International Conference, CAV 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings, Part I(Lecture Notes in Computer Science, Vol.\u00a010981), Hana Chockler and Georg Weissenbacher (Eds.). Springer, 527\u2013546. https:\/\/doi.org\/10.1007\/978-3-319-96145-3_28"},{"key":"e_1_3_2_1_10_1","volume-title":"FORMATS 2021, Paris, France, August 24-26, 2021, Proceedings(Lecture Notes in Computer Science, Vol.\u00a012860)","author":"B\u00f8nneland M.","year":"2021","unstructured":"Frederik\u00a0 M. B\u00f8nneland , Peter\u00a0Gj\u00f8l Jensen , Kim\u00a0 G. Larsen , Marco Mu\u00f1iz , and Jir\u00ed Srba . 2021 . Stubborn Set Reduction for Timed Reachability and Safety Games. In Formal Modeling and Analysis of Timed Systems - 19th International Conference , FORMATS 2021, Paris, France, August 24-26, 2021, Proceedings(Lecture Notes in Computer Science, Vol.\u00a012860) , Catalin Dima and Mahsa Shirmohammadi (Eds.). Springer, 32\u201349. https:\/\/doi.org\/10.1007\/978-3-030-85037-1_3 10.1007\/978-3-030-85037-1_3 Frederik\u00a0M. B\u00f8nneland, Peter\u00a0Gj\u00f8l Jensen, Kim\u00a0G. Larsen, Marco Mu\u00f1iz, and Jir\u00ed Srba. 2021. Stubborn Set Reduction for Timed Reachability and Safety Games. In Formal Modeling and Analysis of Timed Systems - 19th International Conference, FORMATS 2021, Paris, France, August 24-26, 2021, Proceedings(Lecture Notes in Computer Science, Vol.\u00a012860), Catalin Dima and Mahsa Shirmohammadi (Eds.). Springer, 32\u201349. https:\/\/doi.org\/10.1007\/978-3-030-85037-1_3"},{"key":"e_1_3_2_1_11_1","volume-title":"Stubborn Set Reduction for Two-Player Reachability Games. Log. Methods Comput. Sci. 17, 1","author":"B\u00f8nneland Frederik\u00a0Meyer","year":"2021","unstructured":"Frederik\u00a0Meyer B\u00f8nneland , Peter\u00a0Gj\u00f8l Jensen , Kim\u00a0Guldstrand Larsen , Marco Mu\u00f1iz , and Jir\u00ed Srba . 2021. Stubborn Set Reduction for Two-Player Reachability Games. Log. Methods Comput. Sci. 17, 1 ( 2021 ). https:\/\/lmcs.episciences.org\/7278 Frederik\u00a0Meyer B\u00f8nneland, Peter\u00a0Gj\u00f8l Jensen, Kim\u00a0Guldstrand Larsen, Marco Mu\u00f1iz, and Jir\u00ed Srba. 2021. Stubborn Set Reduction for Two-Player Reachability Games. Log. Methods Comput. Sci. 17, 1 (2021). https:\/\/lmcs.episciences.org\/7278"},{"key":"e_1_3_2_1_12_1","volume-title":"4th International Symposium, ATVA 2006","author":"Bouyer Patricia","year":"2006","unstructured":"Patricia Bouyer , Serge Haddad , and Pierre-Alain Reynier . 2006 . Timed Unfoldings for Networks of Timed Automata. In Automated Technology for Verification and Analysis , 4th International Symposium, ATVA 2006 , Beijing, China , October 23-26, 2006(Lecture Notes in Computer Science, Vol.\u00a04218), Susanne Graf and Wenhui Zhang (Eds.). Springer, 292\u2013306. https:\/\/doi.org\/10.1007\/11901914_23 10.1007\/11901914_23 Patricia Bouyer, Serge Haddad, and Pierre-Alain Reynier. 2006. Timed Unfoldings for Networks of Timed Automata. In Automated Technology for Verification and Analysis, 4th International Symposium, ATVA 2006, Beijing, China, October 23-26, 2006(Lecture Notes in Computer Science, Vol.\u00a04218), Susanne Graf and Wenhui Zhang (Eds.). Springer, 292\u2013306. https:\/\/doi.org\/10.1007\/11901914_23"},{"key":"e_1_3_2_1_13_1","volume-title":"4th International Symposium, ATVA 2006","author":"Cassez Franck","year":"2006","unstructured":"Franck Cassez , Thomas Chatain , and Claude Jard . 2006 . Symbolic Unfoldings for Networks of Timed Automata. In Automated Technology for Verification and Analysis , 4th International Symposium, ATVA 2006 , Beijing, China , October 23-26, 2006(Lecture Notes in Computer Science, Vol.\u00a04218), Susanne Graf and Wenhui Zhang (Eds.). Springer, 307\u2013321. https:\/\/doi.org\/10.1007\/11901914_24 10.1007\/11901914_24 Franck Cassez, Thomas Chatain, and Claude Jard. 2006. Symbolic Unfoldings for Networks of Timed Automata. In Automated Technology for Verification and Analysis, 4th International Symposium, ATVA 2006, Beijing, China, October 23-26, 2006(Lecture Notes in Computer Science, Vol.\u00a04218), Susanne Graf and Wenhui Zhang (Eds.). Springer, 307\u2013321. https:\/\/doi.org\/10.1007\/11901914_24"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3360550"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s100090050035"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001650050028"},{"key":"e_1_3_2_1_17_1","volume-title":"TACAS(Lecture Notes in Computer Science, Vol.\u00a01384)","author":"Daws Conrado","unstructured":"Conrado Daws and Stavros Tripakis . 1998. Model Checking of Real-Time Reachability Properties Using Abstractions . In TACAS(Lecture Notes in Computer Science, Vol.\u00a01384) . Springer , 313\u2013329. Conrado Daws and Stavros Tripakis. 1998. Model Checking of Real-Time Reachability Properties Using Abstractions. In TACAS(Lecture Notes in Computer Science, Vol.\u00a01384). Springer, 313\u2013329."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2010.36"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040315"},{"key":"e_1_3_2_1_20_1","volume-title":"Vol.\u00a01032","author":"Godefroid Patrice","unstructured":"Patrice Godefroid . 1996. Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem. Lecture Notes in Computer Science , Vol.\u00a01032 . Springer . https:\/\/doi.org\/10.1007\/3-540-60761-7 10.1007\/3-540-60761-7 Patrice Godefroid. 1996. Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem. Lecture Notes in Computer Science, Vol.\u00a01032. Springer. https:\/\/doi.org\/10.1007\/3-540-60761-7"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263717"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1035"},{"key":"e_1_3_2_1_23_1","first-page":"1","article-title":"Revisiting Local Time Semantics for Networks of Timed Automata. In CONCUR(LIPIcs, Vol.\u00a0140)","volume":"16","author":"Govind R.","year":"2019","unstructured":"R. Govind , Fr\u00e9d\u00e9ric Herbreteau , B. Srivathsan , and Igor Walukiewicz . 2019 . Revisiting Local Time Semantics for Networks of Timed Automata. In CONCUR(LIPIcs, Vol.\u00a0140) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 16 : 1 \u2013 16 :15. R. Govind, Fr\u00e9d\u00e9ric Herbreteau, B. Srivathsan, and Igor Walukiewicz. 2019. Revisiting Local Time Semantics for Networks of Timed Automata. In CONCUR(LIPIcs, Vol.\u00a0140). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 16:1\u201316:15.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_24_1","volume-title":"CAV(Lecture Notes in Computer Science, Vol.\u00a08559)","author":"Hansen Henri","unstructured":"Henri Hansen , Shang-Wei Lin , Yang Liu , Truong\u00a0Khanh Nguyen , and Jun Sun . 2014. Diamonds Are a Girl\u2019s Best Friend: Partial Order Reduction for Timed Automata with Abstractions . In CAV(Lecture Notes in Computer Science, Vol.\u00a08559) . Springer , 391\u2013406. Henri Hansen, Shang-Wei Lin, Yang Liu, Truong\u00a0Khanh Nguyen, and Jun Sun. 2014. Diamonds Are a Girl\u2019s Best Friend: Partial Order Reduction for Timed Automata with Abstractions. In CAV(Lecture Notes in Computer Science, Vol.\u00a08559). Springer, 391\u2013406."},{"key":"e_1_3_2_1_25_1","volume-title":"CAV(Lecture Notes in Computer Science, Vol.\u00a08044)","author":"Herbreteau Fr\u00e9d\u00e9ric","unstructured":"Fr\u00e9d\u00e9ric Herbreteau , B. Srivathsan , and Igor Walukiewicz . 2013. Lazy Abstractions for Timed Automata . In CAV(Lecture Notes in Computer Science, Vol.\u00a08044) . Springer , 990\u20131005. Fr\u00e9d\u00e9ric Herbreteau, B. Srivathsan, and Igor Walukiewicz. 2013. Lazy Abstractions for Timed Automata. In CAV(Lecture Notes in Computer Science, Vol.\u00a08044). Springer, 990\u20131005."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2016.07.004"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02252682"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3498711"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025132427497"},{"key":"e_1_3_2_1_30_1","volume-title":"ATVA 2020, Hanoi, Vietnam, October 19-23, 2020, Proceedings(Lecture Notes in Computer Science, Vol.\u00a012302)","author":"Larsen G.","year":"2020","unstructured":"Kim\u00a0 G. Larsen , Marius Mikucionis , Marco Mu\u00f1iz , and Jir\u00ed Srba . 2020 . Urgent Partial Order Reduction for Extended Timed Automata. In Automated Technology for Verification and Analysis - 18th International Symposium , ATVA 2020, Hanoi, Vietnam, October 19-23, 2020, Proceedings(Lecture Notes in Computer Science, Vol.\u00a012302) , Dang\u00a0Van Hung and Oleg Sokolsky (Eds.). Springer, 179\u2013195. https:\/\/doi.org\/10.1007\/978-3-030-59152-6_10 10.1007\/978-3-030-59152-6_10 Kim\u00a0G. Larsen, Marius Mikucionis, Marco Mu\u00f1iz, and Jir\u00ed Srba. 2020. Urgent Partial Order Reduction for Extended Timed Automata. In Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19-23, 2020, Proceedings(Lecture Notes in Computer Science, Vol.\u00a012302), Dang\u00a0Van Hung and Oleg Sokolsky (Eds.). Springer, 179\u2013195. https:\/\/doi.org\/10.1007\/978-3-030-59152-6_10"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.07.023"},{"key":"e_1_3_2_1_32_1","volume-title":"CONCUR(Lecture Notes in Computer Science, Vol.\u00a01664)","author":"Minea Marius","unstructured":"Marius Minea . 1999. Partial Order Reduction for Model Checking of Timed Automata . In CONCUR(Lecture Notes in Computer Science, Vol.\u00a01664) . Springer , 431\u2013446. Marius Minea. 1999. Partial Order Reduction for Model Checking of Timed Automata. In CONCUR(Lecture Notes in Computer Science, Vol.\u00a01664). Springer, 431\u2013446."},{"key":"e_1_3_2_1_33_1","first-page":"88","article-title":"Fully Symbolic Model Checking of Timed Systems using Difference Decision Diagrams","volume":"23","author":"M\u00f8ller B.","year":"1999","unstructured":"Jesper\u00a0 B. M\u00f8ller , Jakob Lichtenberg , Henrik\u00a0Reif Andersen , and Henrik Hulgaard . 1999 . Fully Symbolic Model Checking of Timed Systems using Difference Decision Diagrams . Electron. Notes Theor. Comput. Sci. 23 , 2 (1999), 88 \u2013 107 . https:\/\/doi.org\/10.1016\/S1571-0661(04)80671-6 10.1016\/S1571-0661(04)80671-6 Jesper\u00a0B. M\u00f8ller, Jakob Lichtenberg, Henrik\u00a0Reif Andersen, and Henrik Hulgaard. 1999. Fully Symbolic Model Checking of Timed Systems using Difference Decision Diagrams. Electron. Notes Theor. Comput. Sci. 23, 2 (1999), 88\u2013107. https:\/\/doi.org\/10.1016\/S1571-0661(04)80671-6","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"e_1_3_2_1_34_1","volume-title":"7th International Symposium, FTRTFT 2002, Co-sponsored by IFIP WG 2.2, Oldenburg, Germany, September 9-12, 2002, Proceedings(Lecture Notes in Computer Science, Vol.\u00a02469)","author":"Niebert Peter","year":"2002","unstructured":"Peter Niebert , Moez Mahfoudh , Eugene Asarin , Marius Bozga , Oded Maler , and Navendu Jain . 2002 . Verification of Timed Automata via Satisfiability Checking. In Formal Techniques in Real-Time and Fault-Tolerant Systems , 7th International Symposium, FTRTFT 2002, Co-sponsored by IFIP WG 2.2, Oldenburg, Germany, September 9-12, 2002, Proceedings(Lecture Notes in Computer Science, Vol.\u00a02469) , Werner Damm and Ernst-R\u00fcdiger Olderog (Eds.). Springer, 225\u2013244. https:\/\/doi.org\/10.1007\/3-540-45739-9_15 10.1007\/3-540-45739-9_15 Peter Niebert, Moez Mahfoudh, Eugene Asarin, Marius Bozga, Oded Maler, and Navendu Jain. 2002. Verification of Timed Automata via Satisfiability Checking. In Formal Techniques in Real-Time and Fault-Tolerant Systems, 7th International Symposium, FTRTFT 2002, Co-sponsored by IFIP WG 2.2, Oldenburg, Germany, September 9-12, 2002, Proceedings(Lecture Notes in Computer Science, Vol.\u00a02469), Werner Damm and Ernst-R\u00fcdiger Olderog (Eds.). Springer, 225\u2013244. https:\/\/doi.org\/10.1007\/3-540-45739-9_15"},{"key":"e_1_3_2_1_35_1","volume-title":"5th International Conference, CAV \u201993","author":"Peled A.","year":"1993","unstructured":"Doron\u00a0 A. Peled . 1993 . All from One, One for All: on Model Checking Using Representatives. In Computer Aided Verification , 5th International Conference, CAV \u201993 , Elounda, Greece, June 28 - July 1, 1993, Proceedings(Lecture Notes in Computer Science, Vol.\u00a0697), Costas Courcoubetis (Ed.). Springer, 409\u2013423. https:\/\/doi.org\/10.1007\/3-540-56922-7_34 10.1007\/3-540-56922-7_34 Doron\u00a0A. Peled. 1993. All from One, One for All: on Model Checking Using Representatives. In Computer Aided Verification, 5th International Conference, CAV \u201993, Elounda, Greece, June 28 - July 1, 1993, Proceedings(Lecture Notes in Computer Science, Vol.\u00a0697), Costas Courcoubetis (Ed.). Springer, 409\u2013423. https:\/\/doi.org\/10.1007\/3-540-56922-7_34"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011202615884"},{"key":"e_1_3_2_1_37_1","volume-title":"Advances in Petri Nets 1990 [10th International Conference on Applications and Theory of Petri Nets, Bonn, Germany, June 1989, Proceedings](Lecture Notes in Computer Science, Vol.\u00a0483)","author":"Valmari Antti","year":"1989","unstructured":"Antti Valmari . 1989 . Stubborn sets for reduced state space generation . In Advances in Petri Nets 1990 [10th International Conference on Applications and Theory of Petri Nets, Bonn, Germany, June 1989, Proceedings](Lecture Notes in Computer Science, Vol.\u00a0483) , Grzegorz Rozenberg (Ed.). Springer, 491\u2013515. https:\/\/doi.org\/10.1007\/3-540-53863-1_36 10.1007\/3-540-53863-1_36 Antti Valmari. 1989. Stubborn sets for reduced state space generation. In Advances in Petri Nets 1990 [10th International Conference on Applications and Theory of Petri Nets, Bonn, Germany, June 1989, Proceedings](Lecture Notes in Computer Science, Vol.\u00a0483), Grzegorz Rozenberg (Ed.). Springer, 491\u2013515. https:\/\/doi.org\/10.1007\/3-540-53863-1_36"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00709154"},{"key":"e_1_3_2_1_39_1","volume-title":"FORTE 2001, IFIP TC6\/WG6.1 - 21st International Conference on Formal Techniques for Networked and Distributed Systems, August 28-31, 2001, Cheju Island, Korea(IFIP Conference Proceedings, Vol.\u00a0197)","author":"Wang Farn","year":"2001","unstructured":"Farn Wang . 2001 . Symbolic Verification of Complex Real-Time Systems with Clock-Restriction Diagram. In Formal Techniques for Networked and Distributed Systems , FORTE 2001, IFIP TC6\/WG6.1 - 21st International Conference on Formal Techniques for Networked and Distributed Systems, August 28-31, 2001, Cheju Island, Korea(IFIP Conference Proceedings, Vol.\u00a0197) , Myungchul Kim, Byoungmoon Chin, Sungwon Kang, and Danhyung Lee (Eds.). Kluwer, 235\u2013250. Farn Wang. 2001. Symbolic Verification of Complex Real-Time Systems with Clock-Restriction Diagram. In Formal Techniques for Networked and Distributed Systems, FORTE 2001, IFIP TC6\/WG6.1 - 21st International Conference on Formal Techniques for Networked and Distributed Systems, August 28-31, 2001, Cheju Island, Korea(IFIP Conference Proceedings, Vol.\u00a0197), Myungchul Kim, Byoungmoon Chin, Sungwon Kang, and Danhyung Lee (Eds.). Kluwer, 235\u2013250."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2737956"}],"event":{"name":"LICS '22: 37th Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"Haifa Israel","acronym":"LICS '22","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation"]},"container-title":["Proceedings of the 37th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533343","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531130.3533343","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:09Z","timestamp":1750186929000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533343"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,2]]},"references-count":40,"alternative-id":["10.1145\/3531130.3533343","10.1145\/3531130"],"URL":"https:\/\/doi.org\/10.1145\/3531130.3533343","relation":{},"subject":[],"published":{"date-parts":[[2022,8,2]]},"assertion":[{"value":"2022-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}