{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T06:41:54Z","timestamp":1726036914616},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030255398"},{"type":"electronic","value":"9783030255404"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25540-4_4","type":"book-chapter","created":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T11:02:35Z","timestamp":1562929355000},"page":"60-78","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Safety and Co-safety Comparator Automata for Discounted-Sum Inclusion"],"prefix":"10.1007","author":[{"given":"Suguman","family":"Bansal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe Y.","family":"Vardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"key":"4_CR1","unstructured":"GLPK. https:\/\/www.gnu.org\/software\/glpk\/"},{"key":"4_CR2","unstructured":"Rabit-Reduce. http:\/\/www.languageinclusion.org\/"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., et al.: Simulation subsumption in ramsey-based b\u00fcchi automata universality and inclusion testing. In: Proceedings of CAV, pp. 132\u2013147. Springer (2010)","DOI":"10.1007\/978-3-642-14295-6_14"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., et al.. Advanced ramsey-based b\u00fcchi automata inclusion testing. In: Proceedings of CONCUR, vol. 11, pp. 187\u2013202. Springer (2011)","DOI":"10.1007\/978-3-642-23217-6_13"},{"issue":"3","key":"4_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF01782772","volume":"2","author":"B Alpern","year":"1987","unstructured":"Alpern, B., Schneider, F.B.: Recognizing safety and liveness. Distrib. Comput. 2(3), 117\u2013126 (1987)","journal-title":"Distrib. Comput."},{"key":"4_CR6","first-page":"1","volume":"50","author":"R Alur","year":"2017","unstructured":"Alur, R., Mamouras, K.: An introduction to the streamqre language. Dependable Softw. Syst. Eng. 50, 1 (2017)","journal-title":"Dependable Softw. Syst. Eng."},{"issue":"2","key":"4_CR7","first-page":"28","volume":"6","author":"B Aminof","year":"2010","unstructured":"Aminof, B., Kupferman, O., Lampert, R.: Reasoning about online algorithms with weighted automata. Trans. Algorithms 6(2), 28 (2010)","journal-title":"Trans. Algorithms"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Andersen, G., Conitzer, V.: Fast equilibrium computation for infinitely repeated games. In: Proceedings of AAAI, pp. 53\u201359 (2013)","DOI":"10.1609\/aaai.v27i1.8573"},{"key":"4_CR9","unstructured":"Andersson, D.: An improved algorithm for discounted payoff games. In: ESSLLI Student Session, pp. 91\u201398 (2006)"},{"key":"4_CR10","unstructured":"Baier, C.: Probabilistic model checking. In: Dependable Software Systems Engineering, pp. 1\u201323 (2016)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Bansal, S., Chaudhuri, S., Vardi, M.Y.: Automata vs linear-programming discounted-sum inclusion. In: Proceedings of International Conference on Computer-Aided Verification (CAV) (2018)","DOI":"10.1007\/978-3-319-96142-2_9"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Bansal, S., Chaudhuri, S., Vardi, M.Y. : Comparator automata in quantitative verification. In: Proceedings of International Conference on Foundations of Software Science and Computation Structures (FoSSaCS) (2018)","DOI":"10.1007\/978-3-319-89366-2_23"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Bansal, S., Chaudhuri, S., Vardi, M.Y.: Comparator automata in quantitative verification (full version). CoRR, abs\/1812.06569 (2018)","DOI":"10.1007\/978-3-319-89366-2_23"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-02658-4_14","volume-title":"Computer Aided Verification","author":"R Bloem","year":"2009","unstructured":"Bloem, R., Chatterjee, K., Henzinger, T.A., Jobstmann, B.: Better quality in synthesis through quantitative objectives. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 140\u2013156. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02658-4_14"},{"issue":"1","key":"4_CR15","first-page":"1","volume":"10","author":"U Boker","year":"2014","unstructured":"Boker, U., Henzinger, T.A.: Exact and approximate determinization of discounted-sum automata. LMCS 10(1), 1\u201313 (2014)","journal-title":"LMCS"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11560548_7","volume-title":"Correct Hardware Design and Verification Methods","author":"A Chakrabarti","year":"2005","unstructured":"Chakrabarti, A., Chatterjee, K., Henzinger, T.A., Kupferman, O., Majumdar, R.: Verifying quantitative properties using bound functions. In: Borrione, D., Paul, W. (eds.) CHARME 2005. LNCS, vol. 3725, pp. 50\u201364. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11560548_7"},{"issue":"4","key":"4_CR17","first-page":"23","volume":"11","author":"K Chatterjee","year":"2010","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. Trans. Computat. Logic 11(4), 23 (2010)","journal-title":"Trans. Computat. Logic"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Sankaranarayanan, S., Vardi, M.Y.: Regular real analysis. In: Proceedings of LICS, pp. 509\u2013518 (2013)","DOI":"10.1109\/LICS.2013.57"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1007\/3-540-45061-0_79","volume-title":"Automata, Languages and Programming","author":"L Alfaro de","year":"2003","unstructured":"de Alfaro, L., Henzinger, T.A., Majumdar, R.: Discounting the future in systems theory. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1022\u20131037. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_79"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-12002-2_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Doyen","year":"2010","unstructured":"Doyen, L., Raskin, J.-F.: Antichain algorithms for finite automata. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 2\u201322. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12002-2_2"},{"key":"4_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01492-5","volume-title":"Handbook of Weighted Automata","author":"M Droste","year":"2009","unstructured":"Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata. Springer, Berlin (2009)"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"D\u2019Antoni, L., Samanta, R., Singh, R.: Qlose: program repair with quantitative objectives. In: Proceedings of CAV, pp. 383\u2013401. Springer (2016)","DOI":"10.1007\/978-3-319-41540-6_21"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-32940-1_11","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"E Filiot","year":"2012","unstructured":"Filiot, E., Gentilini, R., Raskin, J.-F.: Quantitative languages defined by functional automata. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 132\u2013146. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32940-1_11"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"He, K., Lahijanian, M., Kavraki, L.E., Vardi, M.Y.: Reactive synthesis for finite tasks under resource constraints. In: 2017 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 5326\u20135332. IEEE (2017)","DOI":"10.1109\/IROS.2017.8206426"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-319-96145-3_21","volume-title":"Computer Aided Verification","author":"Q Hu","year":"2018","unstructured":"Hu, Q., DAntoni, L.: Syntax-guided synthesis with quantitative syntactic objectives. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 386\u2013403. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_21"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/3-540-48683-6_17","volume-title":"Computer Aided Verification","author":"O Kupferman","year":"1999","unstructured":"Kupferman, O., Vardi, M.Y.: Model checking of safety properties. In: Halbwachs, N., Peled, D. (eds.) CAV 1999. LNCS, vol. 1633, pp. 172\u2013183. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48683-6_17"},{"issue":"3","key":"4_CR27","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1145\/377978.377993","volume":"2","author":"O Kupferman","year":"2001","unstructured":"Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. Trans. Computat. Logic 2(3), 408\u2013429 (2001)","journal-title":"Trans. Computat. Logic"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M.: Quantitative verification: models, techniques and tools. In: Proceedings 6th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC\/FSE), pp. 449\u2013458. ACM Press, September 2007","DOI":"10.1145\/1295014.1295018"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Lahijanian, M., Almagor, S., Fried, D., Kavraki, L.E., Vardi, M.Y.: This time the robot settles for a cost: a quantitative approach to temporal logic planning with partial satisfaction. In: AAAI, pp. 3664\u20133671 (2015)","DOI":"10.1609\/aaai.v29i1.9670"},{"issue":"1","key":"4_CR30","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/2480359.2429079","volume":"48","author":"R Mayr","year":"2013","unstructured":"Mayr, R., Clemente, L.: Advanced automata minimization. ACM SIGPLAN Not. 48(1), 63\u201374 (2013)","journal-title":"ACM SIGPLAN Not."},{"key":"4_CR31","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01492-5_6","volume-title":"Handbook of Weighted Automata","author":"M Mohri","year":"2009","unstructured":"Mohri, M.: Weighted automata algorithms. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2009). https:\/\/doi.org\/10.1007\/978-3-642-01492-5_6"},{"issue":"1","key":"4_CR32","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/csla.2001.0184","volume":"16","author":"M Mohri","year":"2002","unstructured":"Mohri, M., Pereira, F., Riley, M.: Weighted finite-state transducers in speech recognition. Comput. Speech Lang. 16(1), 69\u201388 (2002)","journal-title":"Comput. Speech Lang."},{"key":"4_CR33","volume-title":"A Course in Game Theory","author":"MJ Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT press, Cambridge (1994)"},{"key":"4_CR34","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0927-0507(05)80172-0","volume":"2","author":"ML Puterman","year":"1990","unstructured":"Puterman, M.L.: Markov decision processes. Handbooks Oper. Res. Manag. Sci. 2, 331\u2013434 (1990)","journal-title":"Handbooks Oper. Res. Manag. Sci."},{"key":"4_CR35","volume-title":"Principles of Mathematical Analysis","author":"W Rudin","year":"1964","unstructured":"Rudin, W.: Principles of Mathematical Analysis, vol. 3. McGraw-Hill, New York (1964)"},{"key":"4_CR36","doi-asserted-by":"crossref","unstructured":"Safra, S.: On the complexity of $$\\omega $$ -automata. In: Proceedings of FOCS, pp. 319\u2013327. IEEE (1988)","DOI":"10.1109\/SFCS.1988.21948"},{"key":"4_CR37","volume-title":"Introduction to Reinforcement Learning","author":"RS Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Introduction to Reinforcement Learning, vol. 135. MIT press, Cambridge (1998)"},{"key":"4_CR38","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/11591191_28","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D Tabakov","year":"2005","unstructured":"Tabakov, D., Vardi, M.Y.: Experimental evaluation of classical automata constructions. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 396\u2013411. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11591191_28"},{"key":"4_CR39","volume-title":"Automata, Logics, and Infinite Games: A Guide to Current Research","author":"W Thomas","year":"2002","unstructured":"Thomas, W., Wilke, T., et al.: Automata, Logics, and Infinite Games: A Guide to Current Research, vol. 2500. Springer Science & Business Media, Berlin (2002)"},{"key":"4_CR40","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: The b\u00fcchi complementation saga. In: Annual Symposium on Theoretical Aspects of Computer Science, pp. 12\u201322. Springer (2007)","DOI":"10.1007\/978-3-540-70918-3_2"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25540-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T02:51:48Z","timestamp":1695005508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-25540-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030255398","9783030255404"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25540-4_4","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":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York City, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"15 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/i-cav.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"258","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":"67","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":"0","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":"26% - 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":"9","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}