{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:21:57Z","timestamp":1742926917681,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031353543"},{"type":"electronic","value":"9783031353550"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-35355-0_10","type":"book-chapter","created":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T18:03:11Z","timestamp":1686333791000},"page":"155-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["With a\u00a0Little Help from\u00a0Your Friends: Semi-cooperative Games via\u00a0Joker Moves"],"prefix":"10.1007","author":[{"given":"Petra","family":"van den Bos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marielle","family":"Stoelinga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,10]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"The artefact of this paper for reproducing the experimental results of Section 7. https:\/\/doi.org\/10.5281\/zenodo.7712109","DOI":"10.5281\/zenodo.7712109"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Bartocci, E., Bloem, R., Maderbacher, B., Manjunath, N., Ni\u010dkovi\u0107, D.: Adaptive testing for specification coverage in CPS models. IFAC-PapersOnLine 54(5), 229\u2013234 (2021). 7th IFAC Conference on Analysis and Design of Hybrid Systems ADHS 2021","DOI":"10.1016\/j.ifacol.2021.08.503"},{"key":"10_CR3","unstructured":"Bertsekas, D.P.: Dynamic Programming and Optimal Control. Athena Scientific (1998)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-70918-3_17","volume-title":"STACS 2007","author":"D Berwanger","year":"2007","unstructured":"Berwanger, D.: Admissibility in infinite games. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 188\u2013199. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70918-3_17"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-319-24953-7_29","volume-title":"Automated Technology for Verification and Analysis","author":"R Bloem","year":"2015","unstructured":"Bloem, R., Ehlers, R., K\u00f6nighofer, R.: Cooperative reactive synthesis. In: Finkbeiner, B., Pu, G., Zhang, L. (eds.) ATVA 2015. LNCS, vol. 9364, pp. 394\u2013410. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24953-7_29"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"van den Bos, P., Stoelinga, M.: Tester versus bug: a generic framework for model-based testing via games, vol. 277, pp. 118\u2013132 (2018)","DOI":"10.4204\/EPTCS.277.9"},{"key":"10_CR7","unstructured":"van den Bos, P., Stoelinga, M.: With a little help from your friends: semi-cooperative games via joker moves (2023). Extended version with appendix. arXiv:2304.13417"},{"key":"10_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2021.102678","volume":"209","author":"P van den Bos","year":"2021","unstructured":"van den Bos, P., Vaandrager, F.: State identification for labeled transition systems with inputs and outputs. Sci. Comput. Program. 209, 102678 (2021)","journal-title":"Sci. Comput. Program."},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-30000-9_1","volume-title":"Language and Automata Theory and Applications","author":"R Brenguier","year":"2016","unstructured":"Brenguier, R., et al.: Non-zero sum games for reactive synthesis. In: Dediu, A.-H., Janou\u0161ek, J., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2016. LNCS, vol. 9618, pp. 3\u201323. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30000-9_1"},{"key":"10_CR10","unstructured":"Brenguier, R., P\u00e9rez, G.A., Raskin, J.-F., Sankur, O.: Admissibility in quantitative graph games. CoRR, abs\/1611.08677 (2016)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-540-71209-1_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K Chatterjee","year":"2007","unstructured":"Chatterjee, K., Henzinger, T.A.: Assume-guarantee synthesis. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 261\u2013275. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71209-1_21"},{"key":"10_CR12","unstructured":"ComMA: Introductory ComMA tutorial. https:\/\/www.eclipse.org\/comma\/tutorial\/intro.html"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Dallal, E., Neider, D., Tabuada, P.: Synthesis of safety controllers robust to unmodeled intermittent disturbances. In: 2016 IEEE 55th Conference on Decision and Control (CDC), pp. 7425\u20137430. IEEE (2016)","DOI":"10.1109\/CDC.2016.7799416"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"David, A., Larsen, K.G., Li, S., Nielsen, B.: A game-theoretic approach to real-time system testing. In: Design, Automation and Test in Europe, DATE 2008, pp. 486\u2013491. IEEE (2008)","DOI":"10.1109\/DATE.2008.4484728"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Henzinger, T.A., Kupferman, O.: Concurrent reachability games. In: FOCS 1998: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, p. 564. IEEE Computer Society (1998)","DOI":"10.1109\/SFCS.1998.743507"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2004.04.030","volume":"97","author":"L de Alfaro","year":"2004","unstructured":"de Alfaro, L., Stoelinga, M.: Interfaces: a game-theoretic framework for reasoning about component-based systems. Electron. Notes Theor. Comput. Sci. 97, 3\u201323 (2004)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-642-03816-7_27","volume-title":"Mathematical Foundations of Computer Science 2009","author":"M Faella","year":"2009","unstructured":"Faella, M.: Admissible strategies in infinite games over graphs. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 307\u2013318. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03816-7_27"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-319-41540-6_25","volume-title":"Computer Aided Verification","author":"P Fiter\u0103u-Bro\u015ftean","year":"2016","unstructured":"Fiter\u0103u-Bro\u015ftean, P., Janssen, R., Vaandrager, F.: Combining model learning and model checking to analyze TCP implementations. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 454\u2013471. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41540-6_25"},{"key":"10_CR19","unstructured":"Fokkink, W.: Distributed Algorithms - An Intuitive Approach, 2nd edn (2018)"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Hessel, A., Larsen, K.G., Mikucionis, M., Nielsen, B., Pettersson, P., Skou, A.: Testing real-time systems using UPPAAL. In: Formal Methods and Testing, An Outcome of the FORTEST Network, Revised Selected Papers, pp. 77\u2013117 (2008)","DOI":"10.1007\/978-3-540-78917-8_3"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Hughes, J., Pierce, B.C., Arts, T., Norell, U.: Mysteries of dropbox: property-based testing of a distributed synchronization service. In: 2016 IEEE International Conference on Software Testing, Verification and Validation (ICST), pp. 135\u2013145. IEEE (2016)","DOI":"10.1109\/ICST.2016.37"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Kurtev, I., Schuts, M., Hooman, J., Swagerman, D.-J.: Integrating interface modeling and analysis in an industrial setting. In: Proceedings of the 5th International Conference on Model-Driven Engineering and Software Development - MODELSWARD, pp. 345\u2013352. INSTICC, SciTePress (2017)","DOI":"10.5220\/0006133103450352"},{"issue":"1\u20132","key":"10_CR23","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s00236-019-00345-7","volume":"57","author":"D Neider","year":"2020","unstructured":"Neider, D., Weinert, A., Zimmermann, M.: Synthesizing optimally resilient controllers. Acta Informatica 57(1\u20132), 195\u2013221 (2020)","journal-title":"Acta Informatica"},{"key":"10_CR24","unstructured":"Tretmans, J., van de Laar, M.: Model-based testing with TorXakis: the mysteries of Dropbox revisited. In: Strahonja, V. (ed.),CECIIS : 30th Central European Conference on Information and Intelligent Systems, 2\u20134 October 2019, Varazdin, Croatia. Proceedings, pp. 247\u2013258. Faculty of Organization and Informatics, University of Zagreb, Zagreb (2019)"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-47413-7","volume-title":"Decision and Game Theory for Security","year":"2016","unstructured":"Zhu, Q., Alpcan, T., Panaousis, E., Tambe, M., Casey, W. (eds.): GameSec 2016. LNCS, vol. 9996. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-47413-7"},{"issue":"1","key":"10_CR26","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","volume":"200","author":"W Zielonka","year":"1998","unstructured":"Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoret. Comput. Sci. 200(1), 135\u2013183 (1998)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-35355-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T01:39:08Z","timestamp":1729561148000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-35355-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031353543","9783031353550"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-35355-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Techniques for Distributed Objects, Components, and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"forte2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2023\/forte","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"26","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":"13","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":"3","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":"50% - 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":"5","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)"}}]}}