Published: 18th September 2019|
|Preface Jérôme Leroux and Jean-Francois Raskin|
|Robust, Expressive, and Quantitative Linear Temporal Logics: Pick any Two for Free Daniel Neider, Alexander Weinert and Martin Zimmermann||1|
|Reachability Games with Relaxed Energy Constraints Loïc Hélouët, Nicolas Markey and Ritam Raha||17|
|State Complexity of the Multiples of the Thue-Morse Set Émilie Charlier, Célia Cisternino and Adeline Massuir||34|
|Resource-Aware Automata and Games for Optimal Synthesis Corina Cîrstea||50|
|Characterizing Strongly First Order Dependencies: The Non-Jumping Relativizable Case Pietro Galliani||66|
|A Stay-in-a-Set Game without a Stationary Equilibrium Kristoffer Arnsfelt Hansen and Mikhail Raskin||83|
|Specification and Optimal Reactive Synthesis of Run-time Enforcement Shields Paritosh K. Pandya and Amol Wakankar||91|
|A Parity Game Tale of Two Counters Tom van Dijk||107|
|Simple Fixpoint Iteration To Solve Parity Games Tom van Dijk and Bob Rubbens||123|
|Query Learning Algorithm for Residual Symbolic Finite Automata Kaizaburo Chubachi, Diptarama Hendrian, Ryo Yoshinaka and Ayumi Shinohara||140|
|Algebraic and Combinatorial Tools for State Complexity : Application to the Star-Xor Problem Pascal Caron, Edwin Hamel-de le Court and Jean-Gabriel Luque||154|
|On the Order Type of Scattered Context-Free Orderings Kitti Gelle and Szabolcs Iván||169|
The GandALF symposium was established by a group of Italian computer scientists interested in mathematical logic, automata theory, game theory, and their applications to the specification, design, and verification of complex systems. Its aim is to provide a forum where people from different areas, and possibly with different backgrounds, can fruitfully interact. GandALF has a truly international spirit, as witnessed by the composition of the program and steering committee and by the country distribution of the submitted papers.
The program committee selected 12 papers for presentation at the symposium. Each paper was reviewed by at least three referees, and the selection was based on originality, quality, and relevance to the topics of the call for papers. The scientific program contained presentations on games, learning and synthesis, automata and formal languages, and logic. The program included three invited short talks given by Nicolas Markey (Inria & CNRS & Univ. Rennes, France), Hugo Gimbert (LaBRI, CNRS & Bordeaux-INP & Univ. Bordeaux, France), and Sylvain Schmitz (Université de Paris, France), and four regular invited talks given by Nathanaël Fijalkow (CNRS, France), Emmanuel Filiot (ULB, Belgium) and Mariëlle Stoelinga (U Twente & Radboud University, Netherlands)
We wish to express our thanks to the authors who submitted papers for consideration, to the speakers, to the program committee members and the additional reviewers (also listed below) for their excellent work. We also gratefully thank Bordeaux-INP and Univ. Bordeaux for financial and administrative supports.
We also thank the EasyChair organization for supporting all the tasks related to the selection of contributions, and EPTCS and arXiv for hosting the proceedings. We would like to extend special thanks to the organizing committee, in particular Auriane Dantes and Katel Guerin for local arrangements and for setting up an attractive social program.
Organizing Committee from LaBRI (CNRS & Bordeaux-INP & Univ. Bordeaux)
Giovanni Bacci, Marius Bozga, Riccardo De Benedictis, Isabella Kaufmann, Amaldev Manuel, Federico Mari, Braham Lotfi Mediouni, Sebastian Muskalla, Arno Pauly, Alexandra Silva, B Srivathsan, Daniel Stan, Guillaume Theyssier, and Patrick Totzke.