Table of Contents

• Safe Reinforcement Learning Using Probabilistic Shields (Invited Paper)Nils Jansen 0001, Bettina Könighofer, Sebastian Junges, Alex Serban, Roderick Bloem. [doi]
• On the Axiomatisability of Parallel Composition: A Journey in the SpectrumLuca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik, Mathias Ruggaard Pedersen. [doi]
• Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with StatesKrishnendu Chatterjee, Thomas A. Henzinger, Jan Otop. [doi]
• Probabilistic Analysis of Binary SessionsOmar Inverso, Hernán C. Melgratti, Luca Padovani, Catia Trubiani, Emilio Tuosto. [doi]
• Session Types with Arithmetic RefinementsAnkush Das, Frank Pfenning. [doi]
• Non Axiomatisability of Positive Relation Algebras with Constants, via Graph HomomorphismsAmina Doumane, Damien Pous. [doi]
• On the Separability Problem of String ConstraintsParosh Aziz Abdulla, Mohamed Faouzi Atig, Vrunda Dave, Shankara Narayanan Krishna. [doi]
• Universality Problem for Unambiguous VASSWojciech Czerwinski, Diego Figueira, Piotr Hofman. [doi]
• Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz TracesBharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil. [doi]
• A General Approach to Derive Uncontrolled Reversible SemanticsIvan Lanese, Doriana Medic. [doi]
• Games Where You Can Play Optimally with Arena-Independent Finite MemoryPatricia Bouyer, Stéphane Le Roux 0001, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove. [doi]
• Monte Carlo Tree Search Guided by Symbolic Advice for MDPsDamien Busatto-Gaston, Debraj Chakraborty 0002, Jean-François Raskin. [doi]
• Strategy Complexity of Parity Objectives in Countable MDPsStefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke. [doi]
• Propositional Dynamic Logic for HyperpropertiesJens Oliver Gutsfeld, Markus Müller-Olm, Christoph Ohrem. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov ChainsDavid N. Jansen, Jan Friso Groote, Ferry Timmers, Pengfei Yang. [doi]
• Characteristic Logics for Behavioural Metrics via Fuzzy Lax ExtensionsPaul Wild, Lutz Schröder. [doi]
• A Classification of Weak Asynchronous Models of Distributed ComputingJavier Esparza, Fabian Reiter. [doi]
• Reachability in Two-Dimensional Vector Addition Systems with States: One Test Is for FreeJérôme Leroux, Grégoire Sutre. [doi]
• Decidability and Synthesis of Abstract Inductive InvariantsFrancesco Ranzato. [doi]
• Parametrized Universality Problems for One-Counter NetsShaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke. [doi]
• Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded InputsPaul C. Bell, Pavel Semukhin. [doi]
• Abstraction, Up-To Techniques and Games for Systems of Fixpoint EquationsPaolo Baldan, Barbara König 0001, Tommaso Padoan. [doi]
• Flatness and Complexity of Immediate Observation Petri NetsMikhail A. Raskin, Chana Weil-Kennedy, Javier Esparza. [doi]
• On Ranking Function Synthesis and Termination for Polynomial ProgramsEike Neumann, Joël Ouaknine, James Worrell 0001. [doi]
• Determinisability of One-Clock Timed AutomataLorenzo Clemente, Slawomir Lasota 0001, Radoslaw Piórkowski. [doi]
• Reachability in Fixed Dimension Vector Addition Systems with StatesWojciech Czerwinski, Slawomir Lasota 0001, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki. [doi]
• CONCUR Test-Of-Time Award 2020 Announcement (Invited Paper)Luca Aceto, Jos C. M. Baeten, Patricia Bouyer-Decitre, Holger Hermanns, Alexandra Silva 0001. [doi]
• Deciding the Existence of Cut-Off in Parameterized Rendez-Vous NetworksFlorian Horn 0001, Arnaud Sangnier. [doi]
• Residual Nominal AutomataJoshua Moerman, Matteo Sammartino. [doi]
• Synthesis of Computable Regular Functions of Infinite WordsVrunda Dave, Emmanuel Filiot, Shankara Narayanan Krishna, Nathan Lhote. [doi]
• Reactive Bisimulation Semantics for a Process Algebra with Time-OutsRob van Glabbeek. [doi]
• Monads and Quantitative Equational Theories for Nondeterminism and ProbabilityMatteo Mio, Valeria Vignudelli. [doi]
• Scalable Termination Detection for Distributed Actor SystemsDan Plyukhin, Gul Agha. [doi]
• On the Representation of References in the Pi-CalculusDaniel Hirschkoff, Enguerrand Prebet, Davide Sangiorgi. [doi]
• Session Subtyping and Multiparty Compatibility Using Circular SequentsRoss Horne. [doi]
• Weighted Transducers for Robustness VerificationEmmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin, Sriram Sankaranarayanan 0001, Ashutosh Trivedi 0001. [doi]
• Partially Observable Concurrent Kleene AlgebraJana Wagemaker, Paul Brunet, Simon Docherty, Tobias Kappé, Jurriaan Rot, Alexandra Silva 0001. [doi]
• Modern Applications of Game-Theoretic Principles (Invited Paper)Catuscia Palamidessi, Marco Romanelli 0002. [doi]
• Bounded Reachability Problems Are Decidable in FIFO MachinesBenedikt Bollig, Alain Finkel, Amrita Suresh. [doi]
• The Big-O Problem for Labelled Markov Chains and Weighted AutomataDmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser. [doi]
• A Survey of Bidding Games on Graphs (Invited Paper)Guy Avni, Thomas A. Henzinger. [doi]
• Algebraic Invariants for Linear Hybrid AutomataRupak Majumdar, Joël Ouaknine, Amaury Pouly, James Worrell 0001. [doi]
• Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded SessionsEmanuele D'Osualdo, Felix Stutz. [doi]
• Canonical Solutions to Recursive Equations and Completeness of Equational AxiomatisationsXinxin Liu 0009, Tingting Yu. [doi]
• Characterizing Consensus in the Heard-Of ModelA. R. Balasubramanian, Igor Walukiewicz. [doi]
• On Privacy and Accuracy in Data Releases (Invited Paper)Mário S. Alvim, Natasha Fernandes, Annabelle McIver, Gabriel H. Nunes. [doi]
• Reaching Your Goal Optimally by Playing at Random with No MemoryBenjamin Monmege, Julie Parreaux, Pierre-Alain Reynier. [doi]
• Model-Free Reinforcement Learning for Stochastic Parity GamesErnst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh Trivedi 0001, Dominik Wojtczak. [doi]
• How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving BisimulationClément Aubert, Ioana Cristescu. [doi]
• Coverability in 1-VASS with Disequality TestsShaull Almagor, Nathann Cohen, Guillermo A. Pérez, Mahsa Shirmohammadi, James Worrell 0001. [doi]