{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:16:55Z","timestamp":1743031015794,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030317836"},{"type":"electronic","value":"9783030317843"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-31784-3_22","type":"book-chapter","created":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T21:32:04Z","timestamp":1571607124000},"page":"369-386","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems"],"prefix":"10.1007","author":[{"given":"Jesko","family":"Hecking-Harbusch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Niklas O.","family":"Metzger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,21]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","unstructured":"Beutner, R., Finkbeiner, B., Hecking-Harbusch, J.: Translating asynchronous games for distributed synthesis. In: CONCUR 2019, pp. 26:1\u201326:16 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2019.26","DOI":"10.4230\/LIPIcs.CONCUR.2019.26"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/978-3-642-31424-7_45","volume-title":"Computer Aided Verification","author":"A Bohy","year":"2012","unstructured":"Bohy, A., Bruy\u00e8re, V., Filiot, E., Jin, N., Raskin, J.-F.: Acacia+, a tool for LTL synthesis. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 652\u2013657. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31424-7_45"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.tcs.2014.07.003","volume":"551","author":"B Bonet","year":"2014","unstructured":"Bonet, B., Haslum, P., Khomenko, V., Thi\u00e9baux, S., Vogler, W.: Recent advances in unfolding technique. Theor. Comput. Sci. 551, 84\u2013101 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-642-19835-9_25","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Ehlers","year":"2011","unstructured":"Ehlers, R.: Unbeast: symbolic bounded synthesis. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 272\u2013275. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19835-9_25"},{"key":"22_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77426-6","volume-title":"Unfoldings - A Partial-Order Approach to Model Checking","author":"J Esparza","year":"2008","unstructured":"Esparza, J., Heljanko, K.: Unfoldings - A Partial-Order Approach to Model Checking. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77426-6"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-662-54577-5_20","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P Faymonville","year":"2017","unstructured":"Faymonville, P., Finkbeiner, B., Rabe, M.N., Tentrup, L.: Encodings of bounded synthesis. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 354\u2013370. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54577-5_20"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-319-23506-6_15","volume-title":"Correct System Design","author":"B Finkbeiner","year":"2015","unstructured":"Finkbeiner, B.: Bounded synthesis for Petri games. In: Meyer, R., Platzer, A., Wehrheim, H. (eds.) Correct System Design. LNCS, vol. 9360, pp. 223\u2013237. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23506-6_15"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.4204\/EPTCS.260.5","volume":"260","author":"Bernd Finkbeiner","year":"2017","unstructured":"Finkbeiner, B., Gieseking, M., Hecking-Harbusch, J., Olderog, E.: Symbolic vs. bounded synthesis for Petri games. In: SYNT 2017, pp. 23\u201343 (2017)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-319-21690-4_25","volume-title":"Computer Aided Verification","author":"B Finkbeiner","year":"2015","unstructured":"Finkbeiner, B., Gieseking, M., Olderog, E.-R.: Adam: causality-based synthesis of distributed systems. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 433\u2013439. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_25"},{"key":"22_CR10","unstructured":"Finkbeiner, B., G\u00f6lz, P.: Synthesis in distributed environments. In: FSTTCS 2017, pp. 28:1\u201328:14 (2017)"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.ic.2016.07.006","volume":"253","author":"B Finkbeiner","year":"2017","unstructured":"Finkbeiner, B., Olderog, E.: Petri games: synthesis of distributed systems with causal memory. Inf. Comput. 253, 181\u2013203 (2017)","journal-title":"Inf. Comput."},{"key":"22_CR12","unstructured":"Finkbeiner, B., Schewe, S.: Uniform distributed synthesis. In: LICS 2005, pp. 321\u2013330 (2005)"},{"issue":"5\u20136","key":"22_CR13","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)","journal-title":"STTT"},{"issue":"1","key":"22_CR14","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1145\/1047659.1040315","volume":"40","author":"Cormac Flanagan","year":"2005","unstructured":"Flanagan, C., Godefroid, P.: Dynamic partial-order reduction for model checking software. In: POPL 2005, pp. 110\u2013121 (2005)","journal-title":"ACM SIGPLAN Notices"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-30538-5_23","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"P Gastin","year":"2004","unstructured":"Gastin, P., Lerman, B., Zeitoun, M.: Distributed games with causal memory are decidable for series-parallel systems. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 275\u2013286. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30538-5_23"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-642-39212-2_26","volume-title":"Automata, Languages, and Programming","author":"B Genest","year":"2013","unstructured":"Genest, B., Gimbert, H., Muscholl, A., Walukiewicz, I.: Asynchronous games over tree architectures. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7966, pp. 275\u2013286. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39212-2_26"},{"key":"22_CR17","unstructured":"Gimbert, H.: On the control of asynchronous automata. In: FSTTCS 2017, pp. 30:1\u201330:15 (2017)"},{"key":"22_CR18","doi-asserted-by":"publisher","unstructured":"Hecking-Harbusch, J., Metzger, N.O.: BoundedAdam \u2013 efficient trace encodings for bounded synthesis of Petri games (2019). https:\/\/doi.org\/10.6084\/m9.figshare.8313215","DOI":"10.6084\/m9.figshare.8313215"},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"88","DOI":"10.4204\/EPTCS.277.7","volume":"277","author":"Jesko Hecking-Harbusch","year":"2018","unstructured":"Hecking-Harbusch, J., Tentrup, L.: Solving QBF by abstraction. In: GandALF 2018, pp. 88\u2013102 (2018)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"issue":"3","key":"22_CR20","doi-asserted-by":"crossref","first-page":"247","DOI":"10.3233\/FI-1999-37304","volume":"37","author":"K Heljanko","year":"1999","unstructured":"Heljanko, K.: Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets. Fundam. Inf. 37(3), 247\u2013268 (1999)","journal-title":"Fundam. Inf."},{"key":"22_CR21","unstructured":"Heljanko, K.: Combining symbolic and partial order methods for model checking 1-safe Petri nets. Ph.D. thesis, Aalto University, Helsinki, Finland (2002)"},{"key":"22_CR22","volume-title":"Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use","author":"K Jensen","year":"2013","unstructured":"Jensen, K.: Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use, vol. 2. Springer, Heidelberg (2013)"},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-73368-3_29","volume-title":"Computer Aided Verification","author":"B Jobstmann","year":"2007","unstructured":"Jobstmann, B., Galler, S., Weiglhofer, M., Bloem, R.: Anzu: a tool for property synthesis. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 258\u2013262. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73368-3_29"},{"issue":"2","key":"22_CR24","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00236-003-0122-y","volume":"40","author":"V Khomenko","year":"2003","unstructured":"Khomenko, V., Koutny, M., Vogler, W.: Canonical prefixes of Petri net unfoldings. Acta Inf. 40(2), 95\u2013118 (2003)","journal-title":"Acta Inf."},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-45694-5_11","volume-title":"CONCUR 2002 \u2014 Concurrency Theory","author":"P Madhusudan","year":"2002","unstructured":"Madhusudan, P., Thiagarajan, P.S.: A decidable class of asynchronous distributed controllers. In: Brim, L., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A., Jan\u010dar, P. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 145\u2013160. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45694-5_11"},{"key":"22_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/11590156_16","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"P Madhusudan","year":"2005","unstructured":"Madhusudan, P., Thiagarajan, P.S., Yang, S.: The MSO theory of connectedly communicating processes. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 201\u2013212. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11590156_16"},{"key":"22_CR27","unstructured":"Meulen, J.V., Pecheur, C.: Combining partial order reduction with bounded model checking. In: CPA 2009, pp. 29\u201348 (2009)"},{"key":"22_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-662-47666-6_2","volume-title":"Automata, Languages, and Programming","author":"A Muscholl","year":"2015","unstructured":"Muscholl, A.: Automated synthesis of distributed controllers. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 11\u201327. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_2"},{"key":"22_CR29","unstructured":"Muscholl, A., Walukiewicz, I.: Distributed synthesis for acyclic architectures. In: FSTTCS 2014, pp. 639\u2013651 (2014)"},{"key":"22_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/BFb0035790","volume-title":"Automata, Languages and Programming","author":"A Pnueli","year":"1989","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of an asynchronous reactive module. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds.) ICALP 1989. LNCS, vol. 372, pp. 652\u2013671. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0035790"},{"key":"22_CR31","unstructured":"Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: FOCS 1990, pp. 746\u2013757 (1990)"},{"key":"22_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets: An Introduction","author":"W Reisig","year":"1985","unstructured":"Reisig, W.: Petri Nets: An Introduction. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/978-3-642-69968-9"},{"key":"22_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-319-40970-2_24","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"L Tentrup","year":"2016","unstructured":"Tentrup, L.: Non-prenex QBF solving using abstraction. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 393\u2013401. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40970-2_24"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31784-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T18:09:36Z","timestamp":1575914976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31784-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030317836","9783030317843"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31784-3_22","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":"21 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"28 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/atva2019.iis.sinica.edu.tw\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"87","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":"29","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":"33% - 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.4","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":"Between 1 and 2","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}