Preface
Domenico Cantone and Giorgio Delzanno |
Partial Solvers for Parity Games: Effective Polynomial-Time Composition
Patrick Ah-Fat and Michael Huth | 1 |
Relation-Changing Logics as Fragments of Hybrid Logics
Carlos Areces, Raul Fervari, Guillaume Hoffmann and Mauricio Martel | 16 |
A Delayed Promotion Policy for Parity Games
Massimo Benerecetti, Daniele Dell'Erba and Fabio Mogavero | 30 |
Games for Topological Fixpoint Logic
Nick Bezhanishvili and Clemens Kupke | 46 |
Stochastic Equilibria under Imprecise Deviations in Terminal-Reward Concurrent Games
Patricia Bouyer, Nicolas Markey and Daniel Stan | 61 |
Model Checking the Logic of Allen's Relations Meets and Started-by is P^NP-Complete
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron and Pietro Sala | 76 |
On the Expressive Power of Sub-Propositional Fragments of Modal Logic
Davide Bresolin, Emilio Muñoz-Velasco and Guido Sciavicco | 91 |
Alternation Is Strict For Higher-Order Modal Fixpoint Logic
Florian Bruse | 105 |
A Canonical Model Construction for Iteration-Free PDL with Intersection
Florian Bruse, Daniel Kernberger and Martin Lange | 120 |
Window Parity Games: An Alternative Approach Toward Parity Games with Time Bounds
Véronique Bruyère, Quentin Hautem and Mickael Randour | 135 |
Weighted Linear Dynamic Logic
Manfred Droste and George Rahonis | 149 |
Cycle Detection in Computation Tree Logic
Gaëlle Fontaine, Fabio Mogavero, Aniello Murano, Giuseppe Perelli and Loredana Sorrentino | 164 |
Bounded-oscillation Pushdown Automata
Pierre Ganty and Damir Valput | 178 |
On Quantified Propositional Logics and the Exponential Time Hierarchy
Miika Hannula, Juha Kontinen, Martin Lück and Jonni Virtema | 198 |
Multi-Buffer Simulations for Trace Language Inclusion
Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange and Etienne Lozes | 213 |
Distributed PROMPT-LTL Synthesis
Swen Jacobs, Leander Tentrup and Martin Zimmermann | 228 |
A Semi-Potential for Finite and Infinite Sequential Games (Extended Abstract)
Stéphane Le Roux and Arno Pauly | 242 |
Certification of Prefixed Tableau Proofs for Modal Logic
Tomer Libal and Marco Volpe | 257 |
The Almost Equivalence by Asymptotic Probabilities for Regular Languages and Its Computational Complexities
Yoshiki Nakamura | 272 |
A New Rule for LTL Tableaux
Mark Reynolds | 287 |
Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time
Leander Tentrup, Alexander Weinert and Martin Zimmermann | 302 |