20-22 Sep 2021
GandALF 2021: 12th International Symposium on Games, Automata, Logics, and Formal Verification September 20-22, 2021, Padua (Italy) and also online. CALL FOR PARTICIPATION https://gandalf2021.math.unipd.it/ We are looking forward to seeing you in Padua or at the virtual conference! ABOUT GandALF 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. This year, GANDALF will be organised together with the 3rd Workshop on Artificial Intelligence and fOrmal VERification, Logic, Automata, and sYnthesis (OVERLAY 2021). 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. REGISTRATION The registration for the conference is now open: https://gandalf2021.math.unipd.it/registration. 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. GandALF 2021 PROGRAM Soon, you will find a link to the program here: https://gandalf2021.math.unipd.it/program. Talks and keynotes will happen in the working hours of the CEST time zone. Program Overview: - Overlay Workshop: September 22, 2021 - Main conference: September 20-22, 2021 INVITED SPEAKERS Keynotes https://gandalf2021.math.unipd.it/invited-speakers: ? Roderick Bloem, TU Graz, Austria: ?Shield Synthesis for Safe Reinforcement Learning? ? Anca Muscholl, LaBRI, Bordeaux, France: ?Sound Negotiations? ? Nicola Olivetti, Aix-Marseille University, France: ?Non-normal modal logics vindicated? ? S.E. (Sicco) Verwer, TU Delft, The Netherlands: ?State machine learning in practice using Flexfringe: flexibility, use-cases, and interpretability? LIST OF ACCEPTED PAPERS Shufang Zhu, Lucas Martinelli Tabajara, Geguang Pu and Moshe Vardi: ?Temporal Knowledge Compilation for Realizability Checking and Synthesis? Miikka Vilander: ?Games for Succinctness of Regular Expressions? Javier Esparza, Mikhail Raskin and Christoph Welzel: ?Abduction of trap invariants in parameterized systems? Giovanni Pagliarini and Guido Sciavicco: ?Decision Tree Learning with Spatial Modal Logics? A. R. Balasubramanian and Chana Weil-Kennedy: ?Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent? Erich Grädel, Niels Lücking and Matthias Naaf: ?Semiring Provenance for Büchi Games: Strategy Analysis with Absorptive Polynomials? Simon Jantsch, Jakob Piribauer and Christel Baier: ?Witnessing subsystems for probabilistic systems with low tree width? Jan Rooduijn and Yde Venema: ?Filtration and canonical completeness for the continuous modal ?-calculus? Florian Gallay and Ylies Falcone: ?Decentralized LTL Enforcement? Dhananjay Raju, Ruediger Ehlers and Ufuk Topcu: ?Adapting to the Behavior of Environments with Bounded Memory? 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? Raoul Koudijs: ?Finite Model Property and Bisimulation for Local Logics of Dependence? Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari and Stefano Tonetta: ?Expressiveness of Extended Bounded Response LTL? Tobias Winkler and Maximilian Weininger: ?Stochastic Games with Disjunctions of Multiple Objectives? Clemens Kupke, Johannes Marti and Yde Venema: ?On the Size of Disjunctive Formulas in the ?-calculus? 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? Gustav Grabolle: ?A Nivat theorem for weighted alternating automata over commutative semirings? 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? Antti Kuusisto and Raine Rönnholm: ?The optimal way to play the most difficult repeated coordination games? We hope to welcome you to GandALF 2021 in Padua (Italy) or online! CONTACT For any questions please contact the two PC chairs: Davide Bresolin (davide.bresolin@unipd.it), Pierre Ganty (pierre.ganty@imdea.org) -- [LOGIC] mailing list http://www.dvmlg.de/mailingliste.html Archive: http://www.illc.uva.nl/LogicList/ provided by a collaboration of the DVMLG, the Maths Departments in Bonn and Hamburg, and the ILLC at the Universiteit van Amsterdam