Proceedings Eighth International Symposium on Games, Automata, Logics and Formal Verification

2017/09/06 by Patricia Bouyer, Andrea Orlandini, Pierluigi San Pietro · 17 citations
Computer Science · #cs.GT #cs.FL #cs.LO

paper · pdf · doi:10.4204/eptcs.256

published as EPTCS 256, 2017

arxiv created 2017/09/06 · arxiv updated 2017/09/07

Abstract

This volume contains the proceedings of the Eighth International Symposium on Games, Automata, Logic and Formal Verification (GandALF 2017). The symposium took place in Roma, Italy, from the 20th to the 22nd of September 2017. 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.

Cited by

• Approximation of Weighted Automata with Storage
• Emptiness Problems for Distributed Automata
• The Descriptive Complexity of Modal μ Model-checking Games
• Probabilistic Analysis Based On Symbolic Game Semantics and Model Counting
• Parametric Markov Chains: PCTL Complexity and Fraction-free Gaussian Elimination
• On the Complexity of Model Checking for Syntactically Maximal Fragments of the Interval Temporal Logic HS with Regular Expressions
• An Existence Theorem of Nash Equilibrium in Coq and Isabelle
• The Satisfiability Problem for Boolean Set Theory with a Choice Correspondence
• MK-fuzzy Automata and MSO Logics
• Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games
• Dynamics and Coalitions in Sequential Games
• A Parallel Linear Temporal Logic Tableau
• LTL to Deterministic Emerson-Lei Automata
• Linear-time Temporal Logic with Event Freezing Functions
• Beyond ωBS-regular Languages: ωT-regular Expressions and Counter-Check Automata
• Model Checking Social Network Models
• A Backward-traversal-based Approach for Symbolic Model Checking of Uniform Strategies for Constrained Reachability
• On the Complexity of ATL and ATL* Module Checking
• ParaPlan: A Tool for Parallel Reachability Analysis of Planar Polygonal Differential Inclusion Systems
• Finite-state Strategies in Delay Games

Related

• Proceedings Ninth International Symposium on Games, Automata, Logics, and Formal Verification
• Proceedings 11th International Symposium on Games, Automata, Logics, and Formal Verification
• Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification
• Proceedings of the Seventh International Symposium on Games, Automata, Logics and Formal Verification
• Proceedings Third International Symposium on Games, Automata, Logics and Formal Verification