• Regular games with imperfect information are not that regular
    L. Doyen, T. Soullard

  • As Soon as Possible but Rationally
    V. Bruyère, C. Grandmont, J. Raskin

  • Bi-reachability in Petri nets with data
    Ł. Kamiński, S. Lasota

  • Bidding Games with Charging
    G. Avni, E. Goharshady, T. Henzinger, K. Mallik

  • Minimising the Probabilistic Bisimilarity Distance
    S. Kiefer, Q. Tang

  • Left-Linear Rewriting in Adhesive Categories
    P. Baldan, D. Castelnovo, A. Corradini, F. Gadducci

  • Around Classical and Intuitionistic Linear Processes
    J. Jaramillo, D. Frumin, J. Pérez

  • Strategic Dominance: A New Preorder for Nondeterministic Processes
    T. Henzinger, N. Mazzocchi, N. Saraç

  • Weighted basic parallel processes and combinatorial enumeration
    L. Clemente

  • MITL Model Checking via Generalized Timed Automata and a new Liveness Algorithm
    S. Akshay, R. Govind, P. Gastin, B. Srivathsan

  • Validity of contextual formulas
    J. Esparza, R. Rubio

  • A PSPACE Algorithm for Almost-Sure Rabin Objectives in Multi-Environment MDPs
    M. Suilen, M. van der Vegt, S. Junges

  • Phase-Bounded Broadcast Networks over Topologies of Communication
    L. Guillou, A. Sangnier, N. Sznajder

  • RobTL: Robustness Temporal Logic for CPS
    V. Castiglioni, M. Loreti, S. Tini

  • Risk-averse optimization of total rewards in Markovian models using deviation measures
    C. Baier, J. Piribauer, M. Starke

  • Invariants for One-Counter Automata with Disequality Tests
    D. Chistikov, J. Leroux, H. Sinclair-Banks, N. Waldburger

  • An automata-based approach for synchronizable mailbox communication
    R. Delpy, A. Muscholl, G. Sutre

  • A Spectrum of Approximate Probabilistic Bisimulations
    T. Spork, C. Baier, J. Katoen, J. Piribauer, T. Quatmann

  • The Power of Counting Steps in Quantitative Games
    S. Bose, R. Ibsen-Jensen, D. Purser, P. Totzke, P. Vandenhove

  • Computing Inductive Invariants of Regular Abstraction Frameworks
    V. Krasotin, P. Czerner, J. Esparza, C. Welzel-Mohr

  • Effect Semantics for Quantum Process Calculi
    L. Ceragioli, F. Gadducci, G. Lomurno, G. Tedeschi

  • Fairness and Consensus in Opinion Models
    S. Betancourt, F. Valencia, J. Aranda, J. Díaz

  • Nominal Tree Automata With Name Allocation
    S. Prucker, L. Schröder

  • On Continuous Pushdown VASS in one Dimension
    S. Rao, G. Pérez

  • Progress, Justness and Fairness in Modal mu-Calculus Formulae
    M. Spronck, B. Luttik, T. Willemse

  • Passive Learning of Regular Data Languages in Polynomial Time and Data
    M. Balachander, R. Gentilini, Emmanuel

  • Inapproximability in Weighted Timed Games
    Q. Guilmant, J. Ouaknine

  • Automating Memory Model Metatheory with Intersections
    A. Koutsouridis, M. Kokologiannakis, V. Vafeiadis

  • Behavioural Metrics: Compositionality of the Kantorovich Lifting and an Application to Up-To Techniques
    K. D'Angelo, S. Gurke, J. Kirss, B. König, M. Najafi, W. Różowski, P. Wild

  • Faster and Smaller Solutions of Obliging Games
    D. Hausmann, N. Piterman

  • A Unifying Categorical View on Nondeterministic Iteration and Tests
    S. Goncharov, T. Uustalu

    • Causally Deterministic Markov Decision Processes
      S. Akshay, Tobias Meggendorfer, P.S. Thiagarajan

    • Reversible Transducers over Infinite Words
      Luc Dartois, Loïc Germerie-Guizouarn, Paul Gastin, R. Govind, S. Krishna

    • Centralized vs Decentralized Monitors for Hyperproperties
      Jana Wagemaker, Luca Aceto, Antonis Achilleos, Elli Anastasiadi, Adrian Francalanza, Daniele Gorla

    • History-Determinism vs Fair Simulation
      Udi Boker, Thomas Henzinger, Karoliina Lehtinen, Aditya Prakash

    • Coinductive Techniques for Checking Satisfiability of Generalized Nested
      Lara Stoltenow, Barbara König, Sven Schneider, Andrea Corradini, Leen Lambers, Fernando Orejas

    • Branching Bisimilarity for Processes with Time-outs
      Gaspard Reghem, Rob J. van Glabbeek