- John Christopher McCabe-Dansted, Mark Reynolds
:
A Parallel Linear Temporal Logic Tableau. GandALF 2017: 166-179 - David Müller, Salomon Sickert:
LTL to Deterministic Emerson-Lei Automata. GandALF 2017: 180-194 - Stefano Tonetta:
Linear-time Temporal Logic with Event Freezing Functions. GandALF 2017: 195-209 - Dario Della Monica, Angelo Montanari, Pietro Sala:
Beyond ωBS-regular Languages: ωT-regular Expressions and Counter-Check Automata. GandALF 2017: 223-237 - Raúl Pardo, Gerardo Schneider:
Model Checking Social Network Models. GandALF 2017: 238-252 - Simon Busard, Charles Pecheur:
A Backward-traversal-based Approach for Symbolic Model Checking of Uniform Strategies for Constrained Reachability. GandALF 2017: 253-267 - Laura Bozzelli, Aniello Murano:
On the Complexity of ATL and ATL* Module Checking. GandALF 2017: 268-282 - Andrei Sandler, Olga Tveretina:
ParaPlan: A Tool for Parallel Reachability Analysis of Planar Polygonal Differential Inclusion Systems. GandALF 2017: 283-296 - Martin Zimmermann:
Finite-state Strategies in Delay Games. GandALF 2017: 151-165 - Patricia Bouyer, Andrea Orlandini, Pierluigi San Pietro:
Proceedings Eighth International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2017, Roma, Italy, 20-22 September 2017. EPTCS 256, 2017 [contents] - 2016
- Stéphane Le Roux, Arno Pauly:
A Semi-Potential for Finite and Infinite Sequential Games (Extended Abstract). GandALF 2016: 242-256 - Patrick Ah-Fat, Michael Huth:
Partial Solvers for Parity Games: Effective Polynomial-Time Composition. GandALF 2016: 1-15 - Carlos Areces, Raul Fervari, Guillaume Hoffmann, Mauricio Martel:
Relation-Changing Logics as Fragments of Hybrid Logics. GandALF 2016: 16-29 - Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
A Delayed Promotion Policy for Parity Games. GandALF 2016: 30-45 - Nick Bezhanishvili, Clemens Kupke:
Games for Topological Fixpoint Logic. GandALF 2016: 46-60 - Patricia Bouyer, Nicolas Markey, Daniel Stan:
Stochastic Equilibria under Imprecise Deviations in Terminal-Reward Concurrent Games. GandALF 2016: 61-75 - Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Model Checking the Logic of Allen's Relations Meets and Started-by is PNP-Complete. GandALF 2016: 76-90 - Davide Bresolin, Emilio Muñoz-Velasco, Guido Sciavicco:
On the Expressive Power of Sub-Propositional Fragments of Modal Logic. GandALF 2016: 91-104 - Florian Bruse:
Alternation Is Strict For Higher-Order Modal Fixpoint Logic. GandALF 2016: 105-119 - Florian Bruse, Daniel Kernberger, Martin Lange:
A Canonical Model Construction for Iteration-Free PDL with Intersection. GandALF 2016: 120-134 - Véronique Bruyère, Quentin Hautem, Mickael Randour:
Window parity games: an alternative approach toward parity games with time bounds. GandALF 2016: 135-148 - Manfred Droste, George Rahonis:
Weighted Linear Dynamic Logic. GandALF 2016: 149-163 - Gaëlle Fontaine, Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Loredana Sorrentino:
Cycle Detection in Computation Tree Logic. GandALF 2016: 164-177 - Pierre Ganty, Damir Valput:
Bounded-oscillation Pushdown Automata. GandALF 2016: 178-197 - Miika Hannula, Juha Kontinen, Martin Lück, Jonni Virtema:
On Quantified Propositional Logics and the Exponential Time Hierarchy. GandALF 2016: 198-212 - Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes:
Multi-Buffer Simulations for Trace Language Inclusion. GandALF 2016: 213-227 - Swen Jacobs, Leander Tentrup, Martin Zimmermann:
Distributed PROMPT-LTL Synthesis. GandALF 2016: 228-241 - Tomer Libal, Marco Volpe:
Certification of Prefixed Tableau Proofs for Modal Logic. GandALF 2016: 257-271 - Yoshiki Nakamura:
The Almost Equivalence by Asymptotic Probabilities for Regular Languages and Its Computational Complexities. GandALF 2016: 272-286 - Mark Reynolds:
A New Rule for LTL Tableaux. GandALF 2016: 287-301
