Accepted Papers

  • Alexander Weinert. Quantitative Reductions and Vertex-Ranked Infinite Games
  • Balasubramanian A.R.. Parameterized Verification of Coverability in Well-Structured Broadcast Networks
  • Michele Chiari, Dino Mandrioli, and Matteo Pradella. Temporal Logic and Model Checking for Operator Precedence Languages
  • Luca Geatti, Nicola Gigante, Angelo Montanari, and Mark Reynolds. One-Pass and Tree-Shaped Tableau Systems for TPTL and TPTLb+Past
  • Laura Bozzelli, Alberto Molinari, Angelo Montanari, and Adriano Peron. Complexity of Timeline-based Planning over Dense Temporal Domains: Exploring the Middle Ground
  • Federico Aschieri, Agata Ciabattoni, and Francesco Antonio Genco. Classical Proofs as Parallel Programs
  • Arno Pauly. Parameterized Games and Parameterized Automata
  • Tobias Rosenkrantz Gundersen, Florian Lorber, Ulrik Nyman, and Christian Ovesen. Effortless Fault Localisation: Conformance Testing of Real-Time Systems in Ecdar
  • Thomas Brihaye, Véronique Bruyère, Aline Goeminne, and Jean-Francois Raskin. Constrained existence problem for weak subgame perfect equilibria with ω-regular Boolean objectives
  • Pietro Galliani. Safe Dependency Atoms and Possibility Operators in Team Semantics
  • Marcin Przybyłko. On Computing the Measures of First-Order Definable Sets of Trees
  • Dana Angluin and Dana Fisman. Regular ω-Languages with an Informative Right Congruence
  • Patricia Bouyer, Mauricio González, Nicolas Markey, and Mickael Randour. Multi-weighted Markov Decision Processes with Reachability Objectives
  • Thiago Rocha, Ana Teresa Martins, and Francicleber Ferreira. On Finding a First-Order Sentence Consistent with a Sample of Strings
  • Lisette Sanchez, Wieger Wesselink, and Tim Willemse. A Comparison of BDD-Based Parity Game Solvers
  • Petra van den Bos and Marielle Stoelinga. Tester versus Bug: A Generic Framework for Model-Based Testing via Games
  • Jesko Hecking-Harbusch and Leander Tentrup. Solving QBF by Abstraction
  • Laura Bozzelli, Aniello Murano and Adriano Peron. Timed Context-Free Temporal Logics
  • Éric Goubault, Jérémy Ledent, and Sergio Rajsbaum. A Simplicial Complex Model for Dynamic Epistemic Logic to study Distributed Task Computability


  • Sep 11, 2018: Proceedings published
  • Aug 21, 2018: Program is online
  • Aug 16, 2018: Room block at Hotel Madeleine extended until August 22
  • Aug 1, 2018: Registration opened
  • Aug 1, 2018: Accepted Papers and Local Information added
  • Jun 14, 2018: Deadline extended
  • Apr 24, 2018: Special Issue announced
  • Feb 18, 2018: Invited speakers added
  • Jan 19, 2018: PC added
  • Jan 18, 2018: We are online

Important Dates

All dates are Anywhere on Earth.

  • Abstract submission:
    June 13th 20th, 2018
  • Paper submission:
    June 15th 22nd, 2018
  • Notification:
    August 1st, 2018
  • Camera-ready:
    August 17th, 2018
  • Conference:
    September 26th - 28th, 2018