Proceedings of the Seventh International Symposium on Games, Automata, Logics and Formal Verification

2016/09/13 by Domenico Cantone, Giorgio Delzanno · 18 citations
Computer Science · #cs.LO #cs.FL #cs.GT

paper · pdf · doi:10.4204/eptcs.226

published as EPTCS 226, 2016

arxiv created 2016/09/13 · arxiv updated 2016/09/14

Abstract

This volume contains the proceedings of the Seventh International Symposium on Games, Automata, Logic and Formal Verification (GandALF 2016). The symposium took place in Catania, Italy, from the 14th to the 16th of September 2016. The proceedings of the symposium contain abstracts of the 3 invited talks and 21 full papers that were accepted after a careful evaluation for presentation at the conference. The topics of the accepted papers cover algorithmic game theory, automata theory, synthesis, formal verification, and dynamic, modal and temporal logics.

Cited by

• Distributed PROMPT-LTL Synthesis
• Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time
• Window Parity Games: An Alternative Approach Toward Parity Games with Time Bounds
• Partial Solvers for Parity Games: Effective Polynomial-Time Composition
• Relation-Changing Logics as Fragments of Hybrid Logics
• A Delayed Promotion Policy for Parity Games
• Games for Topological Fixpoint Logic
• Stochastic Equilibria under Imprecise Deviations in Terminal-Reward Concurrent Games
• Model Checking the Logic of Allen's Relations Meets and Started-by is P^NP-Complete
• On the Expressive Power of Sub-Propositional Fragments of Modal Logic
• Alternation Is Strict For Higher-Order Modal Fixpoint Logic
• A Canonical Model Construction for Iteration-Free PDL with Intersection
• Weighted Linear Dynamic Logic
• Cycle Detection in Computation Tree Logic
• Bounded-oscillation Pushdown Automata
• On Quantified Propositional Logics and the Exponential Time Hierarchy
• Multi-Buffer Simulations for Trace Language Inclusion
• A Semi-Potential for Finite and Infinite Sequential Games (Extended Abstract)
• Certification of Prefixed Tableau Proofs for Modal Logic
• The Almost Equivalence by Asymptotic Probabilities for Regular Languages and Its Computational Complexities
• A New Rule for LTL Tableaux

Related

• Proceedings Sixth International Symposium on Games, Automata, Logics and Formal Verification
• Proceedings Fourth International Symposium on Games, Automata, Logics and Formal Verification
• Proceedings Fifth International Symposium on Games, Automata, Logics and Formal Verification
• Proceedings of Second International Symposium on Games, Automata, Logics and Formal Verification
• Proceedings Eighth International Symposium on Games, Automata, Logics and Formal Verification