Brijesh Dongol, Gerhard Schellhorn and Heike Wehrheim. Weak Progressive Forward Simulation is Necessary and Sufficient for Strong Observational Refinement
Victor Khomenko, Maciej Koutny and Alex Yakovlev. Slimming Down Petri Boxes: Compact Petri Net Models of Control Flows
Adam D. Barwell, Alceste Scalas, Nobuko Yoshida and Fangyi Zhou. Generalised Multiparty Session Types with Crash-Stop Failures
Stefan Kiefer and Qiyi Tang. Strategies for MDP Bisimilarity Equivalence and Inequivalence
Ira Fesefeldt, Joost-Pieter Katoen and Thomas Noll. Towards Concurrent Quantitative Separation Logic
Shaull Almagor and Shai Guendelman. Concurrent Games with Multiple Topologies
Wojciech Czerwiński and Piotr Hofman. Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable
A. R. Balasubramanian. Complexity of Coverability in Depth-Bounded Processes
Benjamin Monmege, Julie Parreaux and Pierre-Alain Reynier. Decidability of One-Clock Weighted Timed Games with Arbitrary Weights
James C. A. Main and Mickael Randour. Different strokes in randomised strategies: Revisiting Kuhn's theorem under finite-memory assumptions
Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet and Alan Schmitt. Non-Deterministic Abstract Machines
Patricia Bouyer, Antonio Casares, Mickael Randour and Pierre Vandenhove. Half-Positional Objectives Recognized by Deterministic Büchi Automata
Damien Pous and Jana Wagemaker. Completeness Theorems for Kleene Algebra with Top
Javier Esparza, Mikhail Raskin and Christoph Welzel. Regular Model Checking Upside-Down: An Invariant-Based Approach
Thomas Henzinger, Karoliina Lehtinen and Patrick Totzke. History-deterministic Timed Automata
Luca Ciccone and Luca Padovani. An Infinitary Proof Theory of Linear Logic Ensuring Fair Termination in the Linear π-Calculus
Kush Grover, Jan Kretinsky, Tobias Meggendorfer and Maximilian Weininger. Anytime Guarantees for Reachability in Uncountable Markov Decision Processes
Laura Bozzelli, Adriano Peron and Cesar Sanchez. Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties
Oscar Darwin and Stefan Kiefer. On the Sequential Probability Ratio Test in Hidden Markov Models
Edwin Hamel-de le Court and Emmanuel Filiot. Two-player Boudedness Counter Games
Frédéric Herbreteau, B Srivathsan and Igor Walukiewicz. Checking timed Büchi automata emptiness using the local-time semantics
Marius Bozga, Lucas Bueri and Radu Iosif. On an Invariance Problem for Parameterized Concurrent Systems
Shaull Almagor and Asaf Yeshurun. Determinization of One-Counter Nets
Orna Kupferman and Naama Shamash Halevy. Energy Games with Resource-Bounded Environments
S Akshay, Paul Gastin, R Govind and B Srivathsan. Simulations for Event-Clock Automata
Véronique Bruyère, Jean-Francois Raskin and Clément Tamines. Pareto-Rational Verification
Clément Aubert, Ross Horne and Christian Johansen. Diamonds for Security: A Non-Interleaving Operational Semantics for the Applied Pi-Calculus
Luca Aceto, Valentina Castiglioni, Anna Ingolfsdottir and Bas Luttik. On the Axiomatisation of Branching Bisimulation Congruence over CCS
Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joel Ouaknine, David Purser, Markus Whiteland and James Worrell. Parameter Synthesis for Parametric Probabilistic Dynamical Systems and Prefix-Independent Specifications
Bharat Adsul, Paul Gastin, Saptarshi Sarkar and Pascal Weil. Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
Ugo Dal Lago and Giulia Giusti. On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments
Uli Fahrenberg, Christian Johansen, Georg Struth and Krzysztof Ziemiański. A Kleene Theorem for Higher-Dimensional Automata