{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T19:43:33Z","timestamp":1775850213001,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2012,4,7]],"date-time":"2012-04-07T00:00:00Z","timestamp":1333756800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Softw Tools Technol Transfer"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10009-012-0228-z","type":"journal-article","created":{"date-parts":[[2012,4,6]],"date-time":"2012-04-06T16:35:31Z","timestamp":1333730131000},"page":"519-539","source":"Crossref","is-referenced-by-count":118,"title":["Bounded synthesis"],"prefix":"10.1007","volume":"15","author":[{"given":"Bernd","family":"Finkbeiner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Schewe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,4,7]]},"reference":[{"key":"228_CR1","first-page":"118","volume":"58","author":"A. Biere","year":"2003","unstructured":"Biere A., Cimatti A., Clarke E.M., Strichman O., Zhu Y.: Bounded model checking. Adv. Comput. 58, 118\u2013149 (2003)","journal-title":"Adv. Comput."},{"key":"228_CR2","doi-asserted-by":"crossref","unstructured":"Copty, F., Fix, L., Giunchiglia, E., Kamhi, G., Tacchella, A., Vardi, M.: Benefits of bounded model checking at an industrial setting. In: Proceedings of 13th International Conference on Computer Aided Verification (CAV 2001), 18\u201322 July, Paris, France. Lecture Notes in Computer Science, pp. 436\u2013453. Springer, Berlin (2001)","DOI":"10.1007\/3-540-44585-4_43"},{"key":"228_CR3","doi-asserted-by":"crossref","unstructured":"Castellani, I., Mukund, M., Thiagarajan, P.S.: Synthesizing distributed transition systems from global specification. In: Proceedings of the 19th Conferenceon Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1999), 13\u201315 December, Chennai, India. Lecture Notes in Computer Science, vol. 1738, pp. 219\u2013231. Springer, Berlin (1999)","DOI":"10.1007\/3-540-46691-6_17"},{"key":"228_CR4","first-page":"81","volume-title":"CAV. Lecture Notes in Computer Science, vol. 4144","author":"B. Dutertre","year":"2006","unstructured":"Dutertre B., de Moura L.M.: A fast linear-arithmetic solver for dpll(t). In: Ball, T., Jones, R.B. (eds.) CAV. Lecture Notes in Computer Science, vol. 4144, pp. 81\u201394. Springer, Berlin (2006)"},{"key":"228_CR5","first-page":"365","volume-title":"In: 22nd International Conference on Computer Aided Verification. LNCS, vol. 6174","author":"R. Ehlers","year":"2010","unstructured":"Ehlers R.: Symbolic bounded synthesis. In: Touili, T., Cook, B., Jackson, P. (eds.) In: 22nd International Conference on Computer Aided Verification. LNCS, vol. 6174, pp. 365\u2013379. Springer, Berlin (2010)"},{"key":"228_CR6","doi-asserted-by":"crossref","unstructured":"Ehlers, R.: Unbeast: Symbolic bounded synthesis. In: Proceedings of the 17th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). Lecture Notes in Computer Science, vol. 6605, pp. 272\u2013275. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-19835-9_25"},{"key":"228_CR7","doi-asserted-by":"crossref","unstructured":"Filiot, E., Jin, N., Raskin, J.-F.: An antichain algorithm for LTL realizability. In: Proceedings of the 21st International Conference on Computer Aided Verification (CAV 2009), June 26\u2013July 2, Grenoble, France, Lecture Notes in Computer Science, vol. 5643, pp. 263\u2013277. Springer-Verlag (2009)","DOI":"10.1007\/978-3-642-02658-4_22"},{"key":"228_CR8","doi-asserted-by":"crossref","unstructured":"Finkbeiner, B., Schewe, S.: Uniform distributed synthesis. In: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS 2005), 26\u201329 June, Chicago, IL, USA, pp. 321\u2013330. IEEE Computer Society Press, Los Alamitos (2005)","DOI":"10.1109\/LICS.2005.53"},{"key":"228_CR9","doi-asserted-by":"crossref","unstructured":"Finkbeiner, B., Schewe, S.: SMT-based synthesis of distributed systems. In: Proceedings of the 2nd Workshop on Automated Formal Methods (AFM 2007), 6 November, Atlanta, Georgia, USA, pp. 69\u201376. ACM Press, New York (2007)","DOI":"10.1145\/1345169.1345178"},{"key":"228_CR10","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/dimacs\/035\/02","volume-title":"Satisfiability Problem: Theory and applications. DIMACS Series in Discrete Mathematics and Theoretical Computer Science","author":"J. Gu","year":"1997","unstructured":"Gu J., Purdom P.W., Franco J., Wah B.W.: Algorithms for the satisfiability (SAT) problem: a survey. In: Du, D.-Z., Gu, J., Pardalos, P. (eds.) Satisfiability Problem: Theory and applications. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 19\u2013152. American Mathematical Society, Washington (1997)"},{"key":"228_CR11","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Vardi, M.Y.: Synthesizing distributed systems. In: Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science (LICS 2001), 16\u201319 June, Boston, MA, USA, pp. 389\u2013398. IEEE Computer Society Press, Los Alamitos (2001)","DOI":"10.1109\/LICS.2001.932514"},{"key":"228_CR12","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Vardi, M.Y.: Safraless decision procedures. In: Proceedings 46th IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23\u201325 October, Pittsburgh, PA, USA, pp. 531\u2013540 (2005)","DOI":"10.1109\/SFCS.2005.66"},{"key":"228_CR13","unstructured":"Lustig, Y., Vardi, M. Y.: Synthesis from component libraries. In: Proceedings of the Twelfth International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2009), 22\u201329 March, York, England, UK. Lecture Notes in Computer Science, vol. 5504, pp. 167\u2013181. Springer, Berlin (2009)"},{"key":"228_CR14","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference (DAC 2001), 18\u201322 June, Las Vegas, Nevada, USA, pp. 530\u2013535. ACM Press, New York (2001)","DOI":"10.1145\/378239.379017"},{"issue":"1-2","key":"228_CR15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(94)00214-4","volume":"141","author":"D.E. Muller","year":"1995","unstructured":"Muller D.E., Schupp P.E.: Simulating alternating tree automata by nondeterministic automata: new results and new proofs of the theorems of Rabin, McNaughton and Safra. Theor. Comput. Sci. 141(1-2), 69\u2013107 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"228_CR16","doi-asserted-by":"crossref","unstructured":"Madhusudan, P., Thiagarajan, P.S.: Distributed controller synthesis for local specifications. In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP 2001), 8\u201312 July, Crete, Greece. Lecture Notes in Computer Science, pp. 396\u2013407. Springer, Berlin (2001)","DOI":"10.1007\/3-540-48224-5_33"},{"key":"228_CR17","doi-asserted-by":"crossref","unstructured":"Madhusudan, P., Thiagarajan, P.S.: A decidable class of asynchronous distributed controllers. In: Proceedings of the 13th International Conference on Concurrency Theory (CONCUR 2002), 20\u201323 August, Brno, Czech Republic. Lecture Notes in Computer Science, vol. 2421, pp. 145\u2013160. Springer, Berlin (2002)","DOI":"10.1007\/3-540-45694-5_11"},{"issue":"3:5","key":"228_CR18","first-page":"1","volume":"3","author":"N. Piterman","year":"2007","unstructured":"Piterman N.: From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. J. Log. Methods Comput. Sci. 3(3:5), 1\u201321 (2007)","journal-title":"J. Log. Methods Comput. Sci."},{"key":"228_CR19","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proceedings of FOCS, pp. 46\u201357. IEEE Computer Society Press, Los Alamitos (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"228_CR20","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of an asynchronous reactive module. In: Proceedings of the 16th International Colloquium on Automata, Languages and Programming (ICALP 1998), 11\u201315 July, Stresa, Italy. Lecture Notes in Computer Science, vol. 372, pp. 652\u2013671. Springer, Berlin (1989)","DOI":"10.1007\/BFb0035790"},{"key":"228_CR21","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science (FOCS 1990), 22\u201324 October, St. Louis, Missouri, USA, pp. 746\u2013757. IEEE Computer Society Press, Los Alamitos (1990)","DOI":"10.1109\/FSCS.1990.89597"},{"key":"228_CR22","unstructured":"Rosner, R.: Modular Synthesis of Reactive Systems. PhD thesis, Weizmann Institute of Science, Rehovot, Israel (1992)"},{"key":"228_CR23","doi-asserted-by":"crossref","unstructured":"Safra, S.: On the complexity of the \u03c9-automata. In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 24\u201326 October, White Plains, New York, USA, pp. 319\u2013327. IEEE Computer Society Press, Los Alamitos (1988)","DOI":"10.1109\/SFCS.1988.21948"},{"key":"228_CR24","doi-asserted-by":"crossref","unstructured":"Schewe, S.: Tighter bounds for the determinisation of B\u00fcchi automata. In: Proceedings of the Twelfth International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2009), 22\u201329 March, York, England, UK. Lecture Notes in Computer Science, vol. 5504, pp. 167\u2013181. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-00596-1_13"},{"key":"228_CR25","volume-title":"Software Synthesis. number 09501 in Dagstuhl Seminar Proceedings","author":"S. Schewe","year":"2010","unstructured":"Schewe S.: Software synthesis is hard and simple. In: Bodik, R., Kupferman, O., SmithD.R. Yahav, E. (eds.) Software Synthesis. number 09501 in Dagstuhl Seminar Proceedings, Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Germany (2010)"},{"key":"228_CR26","unstructured":"Schewe, S., Finkbeiner, B.: Synthesis of asynchronous systems. In: Proceedings of the 16th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2006), 12\u201314 July, Venice, Italy. Lecture Notes in Computer Science, vol. 4407, pp. 127\u2013142. Springer, Berlin (2006)"},{"key":"228_CR27","doi-asserted-by":"crossref","unstructured":"Schewe, S., Finkbeiner, B.: Bounded synthesis. In: Proceedings of the 5th International Symposium on Automated Technology for Verification and Analysis (ATVA 2007), 22\u201325 October, Tokyo, Japan, Lecture Notes in Computer Science, vol. 4762, pp. 474\u2013488. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-75596-8_33"},{"key":"228_CR28","doi-asserted-by":"crossref","unstructured":"Schewe, S., Finkbeiner, B.: Distributed synthesis for alternating-time logics. In: Proceedings of the 5th International Symposium on Automated Technology for Verification and Analysis (ATVA 2007), 22\u201325 October, Tokyo, Japan. Lecture Notes in Computer Science, vol. 4762, pp. 268\u2013283. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-75596-8_20"},{"key":"228_CR29","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: An automata-theoretic approach to fair realizability and synthesis. In: Proceedings of the 7th International Conference on Computer Aided Verification (CAV 1995), 3\u20135 July, Liege, Belgium. Lecture Notes in Computer Science, vol. 939, pp. 267\u2013278. Springer, Berlin (1995)","DOI":"10.1007\/3-540-60045-0_56"},{"key":"228_CR30","doi-asserted-by":"crossref","unstructured":"Walukiewicz, I., Mohalik, S.: Distributed games. In: Proceedings of the 23rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2003), 15\u201317 December, Bombay, Mumbai, India. Lecture Notes in Computer Science, vol. 2914, pp. 338\u2013351. Springer, Berlin (2003)","DOI":"10.1007\/978-3-540-24597-1_29"}],"container-title":["International Journal on Software Tools for Technology Transfer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-012-0228-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10009-012-0228-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-012-0228-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T00:53:18Z","timestamp":1561596798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10009-012-0228-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,7]]},"references-count":30,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["228"],"URL":"https:\/\/doi.org\/10.1007\/s10009-012-0228-z","relation":{},"ISSN":["1433-2779","1433-2787"],"issn-type":[{"value":"1433-2779","type":"print"},{"value":"1433-2787","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,7]]}}}