{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:46:20Z","timestamp":1743115580078,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319415277"},{"type":"electronic","value":"9783319415284"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","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":[[2016]]},"DOI":"10.1007\/978-3-319-41528-4_7","type":"book-chapter","created":{"date-parts":[[2016,7,12]],"date-time":"2016-07-12T09:34:06Z","timestamp":1468316046000},"page":"118-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Bounded Cycle Synthesis"],"prefix":"10.1007","author":[{"given":"Bernd","family":"Finkbeiner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,13]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/963927.963928","volume":"5","author":"R Alur","year":"2004","unstructured":"Alur, R., La Torre, S.: Deterministic generators and games for LTL fragments. ACM Trans. Comput. Log. 5(1), 1\u201325 (2004). \n                      http:\/\/doi.acm.org\/10.1145\/963927.963928","journal-title":"ACM Trans. Comput. Log."},{"key":"7_CR2","unstructured":"ARM Ltd.: AMBA Specification (rev. 2) (1999). \n                      www.arm.com"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-28756-5_8","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T Babiak","year":"2012","unstructured":"Babiak, T., K\u0159et\u00ednsk\u00fd, M., \u0158eh\u00e1k, V., Strej\u010dek, J.: LTL to B\u00fcchi automata translation: fast and more deterministic. In: Flanagan, C., K\u00f6nig, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 95\u2013109. Springer, Heidelberg (2012). \n                      http:\/\/dx.doi.org\/10.1007\/978-3-642-28756-5_8"},{"key":"7_CR4","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). \n                      http:\/\/dx.doi.org\/10.1007\/978-3-642-02658-4_14"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). \n                      http:\/\/dx.doi.org\/10.1007\/978-3-540-24605-3_37"},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10703-011-0115-3","volume":"39","author":"E Filiot","year":"2011","unstructured":"Filiot, E., Jin, N., Raskin, J.: Antichains and compositional algorithms for LTL synthesis. Form. Methods Syst. Des. 39(3), 261\u2013296 (2011). \n                      http:\/\/dx.doi.org\/10.1007\/s10703-011-0115-3","journal-title":"Form. Methods Syst. Des."},{"issue":"5\u20136","key":"7_CR7","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10009-012-0222-5","volume":"15","author":"E Filiot","year":"2013","unstructured":"Filiot, E., Jin, N., Raskin, J.: Exploiting structure in LTL synthesis. STTT 15(5\u20136), 541\u2013561 (2013). \n                      http:\/\/dx.doi.org\/10.1007\/s10009-012-0222-5","journal-title":"STTT"},{"key":"7_CR8","unstructured":"Finkbeiner, B., Klein, F.: Bounded cycle synthesis. CoRR abs\/1605.01511 (2016). \n                      http:\/\/arxiv.org\/abs\/1605.01511"},{"issue":"5\u20136","key":"7_CR9","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s10009-012-0228-z","volume":"15","author":"B Finkbeiner","year":"2013","unstructured":"Finkbeiner, B., Schewe, S.: Bounded synthesis. STTT 15(5\u20136), 519\u2013539 (2013). \n                      http:\/\/dx.doi.org\/10.1007\/s10009-012-0228-z","journal-title":"STTT"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-72200-7_23","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2007","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: clasp: a conflict-driven answer set solver. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 260\u2013265. Springer, Heidelberg (2007). \n                      http:\/\/dx.doi.org\/10.1007\/978-3-540-72200-7_23"},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"112","DOI":"10.4204\/EPTCS.229.10","volume":"229","author":"Swen Jacobs","year":"2016","unstructured":"Jacobs, S., Klein, F.: A high-level LTL synthesis format: TLSF v1.1 (Extended Version). CoRR abs\/1604.02284 (2016). \n                      http:\/\/arxiv.org\/abs\/1604.02284","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Jobstmann, B.: Applications and optimizations for LTL synthesis. Ph.D. thesis, Graz University of Technology, March 2007","DOI":"10.1109\/FMCAD.2006.22"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"DB Johnson","year":"1975","unstructured":"Johnson, D.B.: Finding all the elementary circuits of a directed graph. SIAM J. Comput. 4(1), 77\u201384 (1975). \n                      http:\/\/dx.doi.org\/10.1137\/0204007","journal-title":"SIAM J. Comput."},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-27660-6_8","volume-title":"SOFSEM 2012: Theory and Practice of Computer Science","author":"O Kupferman","year":"2012","unstructured":"Kupferman, O.: Recent challenges and ideas in temporal synthesis. In: Bielikov\u00e1, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Tur\u00e1n, G. (eds.) SOFSEM 2012. LNCS, vol. 7147, pp. 88\u201398. Springer, Heidelberg (2012). doi:\n                      10.1007\/978-3-642-27660-6_8"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Vardi, M.Y.: Safraless decision procedures. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23\u201325 October 2005, Pittsburgh, PA, USA, Proceedings, pp. 531\u2013542. IEEE Computer Society (2005). \n                      http:\/\/dx.doi.org\/10.1109\/SFCS.2005.66","DOI":"10.1109\/SFCS.2005.66"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Piterman, N.: From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. Log. Methods Comput. Sci. 3(3) (2007). \n                      http:\/\/dx.doi.org\/10.2168\/LMCS-3(3:5)2007","DOI":"10.2168\/LMCS-3(3:5)2007"},{"issue":"12","key":"7_CR17","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1145\/362814.362819","volume":"13","author":"JC Tiernan","year":"1970","unstructured":"Tiernan, J.C.: An efficient search algorithm to find the elementary circuits of a graph. Commun. ACM 13(12), 722\u2013726 (1970). \n                      http:\/\/doi.acm.org\/10.1145\/362814.362819","journal-title":"Commun. ACM"},{"issue":"1","key":"7_CR18","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/321679.321684","volume":"19","author":"H Weinblatt","year":"1972","unstructured":"Weinblatt, H.: A new search algorithm for finding the simple cycles of a finite directed graph. J. ACM 19(1), 43\u201356 (1972). \n                      http:\/\/doi.acm.org\/10.1145\/321679.321684","journal-title":"J. ACM"}],"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-319-41528-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,14]],"date-time":"2020-07-14T00:04:17Z","timestamp":1594685057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41528-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319415277","9783319415284"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41528-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"13 July 2016","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":"Toronto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}