
<html xmlns="http://www.w3.org/1999/xhtml">

<head>

<title></title>

</head>

<body>

<div name="messageBodySection">

<div dir="auto"><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">GandALF 2021: 12th International Symposium on Games, Automata, Logics, and Formal Verification </span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">September 20-22, 2021, Padua (Italy) and also online. </span><span style="font-size: 11pt"><br /></span><span style="font-size: 11pt"><br /></span><strong style="color:#434343;background-color:transparent;font-family:Arial;font-size: 14pt">CALL FOR PARTICIPATION</strong><span style="font-size: 14pt"><br /></span><a style="background-color:transparent;font-family:Arial;font-size: 11pt" href="https://urldefense.com/v3/__https://gandalf2021.math.unipd.it/__;!!IBzWLUs!GCumOO8Jbx8hlKFhqmhcJm86yvPdRKpviW_KO4PlH3MF2_aL1n3cvJ6Xn82h1PK8CGdOrBBEpDBPEA$" target="_blank">https://gandalf2021.math.unipd.it/</a><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">We are looking forward to seeing you in Padua or at the virtual conference!</span><span style="font-size: 11pt"><br /></span><span style="font-size: 11pt"><br /></span><span style="color:#434343;background-color:transparent;font-family:Arial;font-size: 14pt">ABOUT GandALF</span><span style="font-size: 14pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">GandALF 2021 is the 12th in a series dedicated to Games, Automata, Logics, and Formal Verification. The aim of GandALF 2021 symposium is to bring together researchers from academia and industry which are actively working in the fields of Games, Automata, Logics, and Formal Verification. The idea is to cover an ample spectrum of themes, ranging from theory to applications, and stimulate cross-fertilization.</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">This year, GANDALF will be organised together with the 3rd Workshop on Artificial Intelligence and fOrmal VERification, Logic, Automata, and sYnthesis (</span><a style="background-color:transparent;font-family:Arial;font-size: 11pt" href="https://urldefense.com/v3/__https://overlay.uniud.it/workshop/2021/__;!!IBzWLUs!GCumOO8Jbx8hlKFhqmhcJm86yvPdRKpviW_KO4PlH3MF2_aL1n3cvJ6Xn82h1PK8CGdOrBCSuxI0dg$" target="_blank">OVERLAY 2021</a><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">). The OVERLAY workshop focuses on the relationships between Artificial Intelligence and Formal Methods, and discusses the opportunities and challenges at the border of the two areas. Both events will be hosted by the University of Padua, and will share some invited speakers. We encourage participation in both events.</span><span style="font-size: 11pt"><br /></span><span style="font-size: 11pt"><br /></span><strong style="color:#434343;background-color:transparent;font-family:Arial;font-size: 14pt">REGISTRATION</strong><span style="font-size: 14pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">The registration for the conference is now open:</span> <a style="background-color:transparent;font-family:Arial;font-size: 11pt" href="https://urldefense.com/v3/__https://gandalf2021.math.unipd.it/registration__;!!IBzWLUs!GCumOO8Jbx8hlKFhqmhcJm86yvPdRKpviW_KO4PlH3MF2_aL1n3cvJ6Xn82h1PK8CGdOrBCv-apJCw$" target="_blank">https://gandalf2021.math.unipd.it/registration</a><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">.</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Early registration is possible until August 31st 2021, with regular registration being possible up to the conference. Registration fees vary from 0€ to 350€ depending on what you wish to attend and your professional situation.</span><span style="font-size: 11pt"><br /></span><span style="font-size: 11pt"><br /></span><strong style="color:#434343;background-color:transparent;font-family:Arial;font-size: 14pt">GandALF 2021 PROGRAM</strong><span style="font-size: 14pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Soon, you will find a link to the program here:</span> <a style="background-color:transparent;font-family:Arial;font-size: 11pt" href="https://urldefense.com/v3/__https://gandalf2021.math.unipd.it/program__;!!IBzWLUs!GCumOO8Jbx8hlKFhqmhcJm86yvPdRKpviW_KO4PlH3MF2_aL1n3cvJ6Xn82h1PK8CGdOrBA8qqH87A$" target="_blank">https://gandalf2021.math.unipd.it/program</a><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">.</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Talks and keynotes will happen in the working hours of the CEST time zone.</span><span style="font-size: 11pt"><br /></span><span style="font-size: 11pt"><br /></span><strong style="color:#666666;background-color:transparent;font-family:Arial;font-size: 12pt">Program Overview:</strong><span style="font-size: 12pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">- Overlay Workshop: September 22, 2021</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">- Main conference: September 20-22, 2021</span><span style="font-size: 11pt"><br /></span><span style="font-size: 11pt"><br /></span><strong style="color:#434343;background-color:transparent;font-family:Arial;font-size: 14pt">INVITED SPEAKERS</strong><span style="font-size: 14pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Keynotes</span> <a style="background-color:transparent;font-family:Arial;font-size: 11pt" href="https://urldefense.com/v3/__https://gandalf2021.math.unipd.it/invited-speakers__;!!IBzWLUs!GCumOO8Jbx8hlKFhqmhcJm86yvPdRKpviW_KO4PlH3MF2_aL1n3cvJ6Xn82h1PK8CGdOrBB4AkV8Xg$" target="_blank">https://gandalf2021.math.unipd.it/invited-speakers</a><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">:</span></div>

<ul>

<li style="font-size: 11pt"><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Roderick Bloem, TU Graz, Austria: “Shield Synthesis for Safe Reinforcement Learning”</span></li>

<li style="font-size: 11pt"><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Anca Muscholl, LaBRI, Bordeaux, France: “Sound Negotiations”</span></li>

<li style="font-size: 11pt"><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Nicola Olivetti, Aix-Marseille University, France: “Non-normal modal logics vindicated”</span></li>

<li style="font-size: 11pt"><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">S.E. (Sicco) Verwer, TU Delft, The Netherlands: “State machine learning in practice using Flexfringe: flexibility, use-cases, and interpretability”</span></li>

</ul>

<div dir="auto"><strong style="color:#434343;background-color:transparent;font-family:Arial;font-size: 14pt">LIST OF ACCEPTED PAPERS</strong><span style="font-size: 14pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Shufang Zhu, Lucas Martinelli Tabajara, Geguang Pu and Moshe Vardi: “Temporal Knowledge Compilation for Realizability Checking and Synthesis”</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Miikka Vilander: “Games for Succinctness of Regular Expressions”</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Javier Esparza, Mikhail Raskin and Christoph Welzel: “Abduction of trap invariants in parameterized systems”</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Giovanni Pagliarini and Guido Sciavicco: “Decision Tree Learning with Spatial Modal Logics”</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">A. R. Balasubramanian and Chana Weil-Kennedy: “Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent”</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Erich Grädel, Niels Lücking and Matthias Naaf: “Semiring Provenance for Büchi Games: Strategy Analysis with Absorptive Polynomials”</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Simon Jantsch, Jakob Piribauer and Christel Baier: “Witnessing subsystems for probabilistic systems with low tree width”</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Jan Rooduijn and Yde Venema: “Filtration and canonical completeness for the continuous modal μ-calculus”</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Florian Gallay and Ylies Falcone: “Decentralized LTL Enforcement”</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Dhananjay Raju, Ruediger Ehlers and Ufuk Topcu: “Adapting to the Behavior of Environments with Bounded Memory”</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Ashwani Anand, Nathanaël Fijalkow, Aliénor Goubault-Larrecq, Leroux Jérôme and Pierre Ohlmann: “New Algorithms for Combinations of Objectives using Separating Automata”</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Raoul Koudijs: “Finite Model Property and Bisimulation for Local Logics of Dependence”</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari and Stefano Tonetta: “Expressiveness of Extended Bounded Response LTL”</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Tobias Winkler and Maximilian Weininger: “Stochastic Games with Disjunctions of Multiple Objectives”</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Clemens Kupke, Johannes Marti and Yde Venema: “On the Size of Disjunctive Formulas in the μ-calculus”</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Laura Bozzelli, Angelo Montanari, Adriano Peron and Pietro Sala: “Adding the relation Meets to the temporal logic of prefixes and infixes makes it EXPSPACE-complete”</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Gustav Grabolle: “A Nivat theorem for weighted alternating automata over commutative semirings”</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Domenico Cantone, Andrea De Domenico and Pietro Maugeri: “On the convexity of a fragment of pure set theory with applications within a Nelson-Oppen framework”</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Antti Kuusisto and Raine Rönnholm: “The optimal way to play the most difficult repeated coordination games”</span><span style="font-size: 11pt"><br /></span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">We hope to welcome you to GandALF 2021 in Padua (Italy) or online!</span><span style="font-size: 11pt"><br /></span><span style="font-size: 11pt"><br /></span><strong style="color:#434343;background-color:transparent;font-family:Arial;font-size: 14pt">CONTACT</strong><span style="font-size: 14pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">For any questions please contact the two PC chairs:</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Davide Bresolin (</span><a style="background-color:transparent;font-family:Arial;font-size: 11pt" href="https://urldefense.com/v3/__https://mailto:davide.bresolin@unipd.it__;!!IBzWLUs!GCumOO8Jbx8hlKFhqmhcJm86yvPdRKpviW_KO4PlH3MF2_aL1n3cvJ6Xn82h1PK8CGdOrBBbFQkSNg$" target="_blank">davide.bresolin@unipd.it</a><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">),</span><span style="font-size: 11pt"><br /></span><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">Pierre Ganty (</span><a style="background-color:transparent;font-family:Arial;font-size: 11pt" href="https://urldefense.com/v3/__https://mailto:pierre.ganty@imdea.org__;!!IBzWLUs!GCumOO8Jbx8hlKFhqmhcJm86yvPdRKpviW_KO4PlH3MF2_aL1n3cvJ6Xn82h1PK8CGdOrBCNCQLTbA$" target="_blank">pierre.ganty@imdea.org</a><span style="color:#000000;background-color:transparent;font-family:Arial;font-size: 11pt">)</span></div>

</div>

</body>

</html>