List of accepted papers
  • Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr and Patrick Totzke: Universal Safety for Timed Petri Nets is PSPACE-complete
  • Benedikt Bollig, Marie Fortin and Paul Gastin: It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before"
  • Jan Křetínský, Guillermo Perez and Jean-Francois Raskin: Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints
  • Qiyi Tang and Franck van Breugel: Deciding Probabilistic Bisimilarity Distance One for Probabilistic Automata
  • Jakub Michaliszyn and Jan Otop: Non-deterministic Weighted Automata on Random Words
  • Piotr Hofman and Sławomir Lasota: Linear Equations with Ordered Data
  • Tyler Sorensen, Hugues Evrard and Alastair Donaldson: GPU schedulers: how fair is fair enough?
  • Véronique Bruyère, Quentin Hautem and Jean-Francois Raskin: Parameterized complexity of games with monotonically ordered w-regular objectives
  • Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen and Yaron Velner: Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies
  • Tomasz Brengos: A coalgebraic take on regular and $\omega$-regular behaviour for systems with internal moves
  • Michael Blondin, Javier Esparza and Antonin Kucera: Automatic Analysis of Expected Termination Time for Population Protocols
  • Jure Kukovec, Igor Konnov and Josef Widder: Reachability in Parameterized Systems: All Flavors of Threshold Automata
  • Roland Meyer, Sebastian Muskalla and Georg Zetzsche: Bounded Context Switching for Valence Systems
  • Nima Roohi, Pavithra Prabhakar and Mahesh Viswanathan: Relating Syntactic and Semantic Perturbations of Hybrid Automata
  • Stephanie Balzer, Frank Pfenning and Bernardo Toninho: A Universal Session Type for Untyped Asynchronous Communication
  • Paulin Fournier and Hugo Gimbert: Alternating Nonzero Automata
  • Michael Blondin, Christoph Haase and Filip Mazowiecki: Affine Extensions of Integer Vector Addition Systems with States
  • Luca Aceto, Ian Cassar, Adrian Francalanza and Anna Ingolfsdottir: On Runtime Enforcement via Suppressions
  • Shaull Almagor, Mehran Hosseini, Joel Ouaknine, James Worrell and Brynmor Chapman: Effective Divergence Analysis for Linear Recurrence Sequences
  • Barbara König and Christina Mika-Michalski: (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras
  • Filippo Bonchi, Barbara König and Daniela Petrisan: Up-To Techniques for Behavioural Metrics via Fibrations
  • Benjamin Cabrera, Tobias Heindel, Reiko Heckel and Barbara König: Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks
  • Javier Esparza, Pierre Ganty and Rupak Majumdar: Verification of Immediate Observation Population Protocols
  • Paul Gastin, Sayan Mukherjee and B Srivathsan: Reachability in timed automata with diagonal constraints
  • Radu Grigore and Stefan Kiefer: Selective Monitoring
  • Massimo Bartoletti, Laura Bocchi and Maurizio Murgia: Progress-preserving Refinements of CTA
  • Wojciech Czerwinski, Sławomir Lasota, Roland Meyer, Sebastian Muskalla, K Narayan Kumar and Prakash Saivasan: Regular Separability of Well-Structured Transition Systems
  • Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar and Prakash Saivasan: Verifying Quantitative Temporal Properties of Procedural Programs.
  • Rodica Condurache, Youssouf Oualhadj and Nicolas Troquard: The Complexity of Concurrent Rational Synthesis
  • Amina Doumane and Damien Pous: Completeness for Identity-free Kleene Lattices
  • Bernhard Kragl, Shaz Qadeer and Thomas A. Henzinger: Synchronizing the Asynchronous
  • Sergey Goncharov, Julian Jakob and Renato Neves: A Semantics for Hybrid Iteration
  • Kartik Nagar and Suresh Jagannathan: Automated Detection of Serializability Violations under Weak Consistency
  • Jan Křetínský and Alexej Rotar: The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL
  • Andrey Gorlin and C. R. Ramakrishnan: Separable GPL: decidable model checking with more non-determinism
  • Krishna S, Khushraj Madnani and Paritosh Pandya: Logics meet 1-clock Alternating Automata
  • Ronny Tredup and Christian Rosenke: Narrowing down the Hardness Barrier of Synthesizing Elementary Nets