LIPIcs, Volume 203, CONCUR 2021

• Serge Haddad and Daniele Varacca LIPIcs, Volume 203, CONCUR 2021, Complete Volume 10.4230/LIPIcs.CONCUR.2021
• Serge Haddad and Daniele Varacca Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.CONCUR.2021.0
• Nathalie Bertrand, Luca de Alfaro, Rob van Glabbeek, Catuscia Palamidessi, and Nobuko Yoshida CONCUR Test-Of-Time Award 2021 (Invited Paper) 10.4230/LIPIcs.CONCUR.2021.1
• Vojtěch Havlena and Ondřej Lengál Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation 10.4230/LIPIcs.CONCUR.2021.2
• Kyveli Doveri, Pierre Ganty, Francesco Parolini, and Francesco Ranzato Inclusion Testing of Büchi Automata Based on Well-Quasiorders 10.4230/LIPIcs.CONCUR.2021.3
• Henning Urbat, Daniel Hausmann, Stefan Milius, and Lutz Schröder Nominal Büchi Automata with Name Allocation 10.4230/LIPIcs.CONCUR.2021.4
• Javier Esparza, Stefan Kiefer, Jan Křetínský, and Maximilian Weininger Enforcing ω-Regular Properties in Markov Chains by Restarting 10.4230/LIPIcs.CONCUR.2021.5
• Stefan Kiefer, Pavel Semukhin, and Cas Widdershoven Linear-Time Model Checking Branching Processes 10.4230/LIPIcs.CONCUR.2021.6
• Jakob Piribauer, Christel Baier, Nathalie Bertrand, and Ocan Sankur Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity Checking 10.4230/LIPIcs.CONCUR.2021.7
• Léonard Brice, Jean-François Raskin, and Marie van den Bogaard Subgame-Perfect Equilibria in Mean-Payoff Games 10.4230/LIPIcs.CONCUR.2021.8
• Mrudula Balachander, Shibashis Guha, and Jean-François Raskin Fragility and Robustness in Mean-Payoff Adversarial Stackelberg Games 10.4230/LIPIcs.CONCUR.2021.9
• Alexander Kozachinskiy Continuous Positional Payoffs 10.4230/LIPIcs.CONCUR.2021.10
• Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, and Patrick Totzke Transience in Countable MDPs 10.4230/LIPIcs.CONCUR.2021.11
• Richard Mayr and Eric Munday Strategy Complexity of Mean Payoff, Total Payoff and Point Payoff Objectives in Countable MDPs 10.4230/LIPIcs.CONCUR.2021.12
• Ming Xu, Jingyi Mei, Ji Guan, and Nengkun Yu Model Checking Quantum Continuous-Time Markov Chains 10.4230/LIPIcs.CONCUR.2021.13
• Benedikt Bollig, Cinzia Di Giusto, Alain Finkel, Laetitia Laversa, Etienne Lozes, and Amrita Suresh A Unifying Framework for Deciding Synchronizability 10.4230/LIPIcs.CONCUR.2021.14
• Nathalie Bertrand, Bastien Thomas, and Josef Widder Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms 10.4230/LIPIcs.CONCUR.2021.15
• Rucha Kulkarni, Umang Mathur, and Andreas Pavlogiannis Dynamic Data-Race Detection Through the Fine-Grained Lens 10.4230/LIPIcs.CONCUR.2021.16
• A. R. Balasubramanian and K. S. Thejaswini Adaptive Synchronisation of Pushdown Automata 10.4230/LIPIcs.CONCUR.2021.17
• Ismaël Jecker, Nicolas Mazzocchi, and Petra Wolf Decomposing Permutation Automata 10.4230/LIPIcs.CONCUR.2021.18
• Michele Boreale and Daniele Gorla Algebra and Coalgebra of Stream Products 10.4230/LIPIcs.CONCUR.2021.19
• Simon Foster, Chung-Kil Hur, and Jim Woodcock Formally Verified Simulations of State-Rich Processes Using Interaction Trees in Isabelle/HOL 10.4230/LIPIcs.CONCUR.2021.20
• Mayuko Kori, Ichiro Hasuo, and Shin-ya Katsumata Fibrational Initial Algebra-Final Coalgebra Coincidence over Initial Algebras: Turning Verification Witnesses Upside Down 10.4230/LIPIcs.CONCUR.2021.21
• Muhammad Syifa'ul Mufid, Andrea Micheli, Alessandro Abate, and Alessandro Cimatti SMT-Based Model Checking of Max-Plus Linear Systems 10.4230/LIPIcs.CONCUR.2021.22
• Florian Bruse and Martin Lange A Decidable Non-Regular Modal Fixpoint Logic 10.4230/LIPIcs.CONCUR.2021.23
• Raven Beutner and Bernd Finkbeiner A Temporal Logic for Strategic Hyperproperties 10.4230/LIPIcs.CONCUR.2021.24
• James C. A. Main, Mickael Randour, and Jeremy Sproston Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives 10.4230/LIPIcs.CONCUR.2021.25
• Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, and Pierre Vandenhove Arena-Independent Finite-Memory Determinacy in Stochastic Games 10.4230/LIPIcs.CONCUR.2021.26
• Véronique Bruyère, Jean-François Raskin, and Clément Tamines Stackelberg-Pareto Synthesis 10.4230/LIPIcs.CONCUR.2021.27
• Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Florian Luca, Joël Ouaknine, David Purser, Markus A. Whiteland, and James Worrell The Orbit Problem for Parametric Linear Dynamical Systems 10.4230/LIPIcs.CONCUR.2021.28
• Aneesh K. Shetty, S. Krishna, and Georg Zetzsche Scope-Bounded Reachability in Valence Systems 10.4230/LIPIcs.CONCUR.2021.29
• Michal Ajdarów and Antonín Kučera Deciding Polynomial Termination Complexity for VASS Programs 10.4230/LIPIcs.CONCUR.2021.30
• Jan Friso Groote, Jan Martens, and Erik de Vink Bisimulation by Partitioning Is Ω((m+n)log n) 10.4230/LIPIcs.CONCUR.2021.31
• Thorsten Wißmann, Stefan Milius, and Lutz Schröder Explaining Behavioural Inequivalence Generically in Quasilinear Time 10.4230/LIPIcs.CONCUR.2021.32
• Rob van Glabbeek, Peter Höfner, and Weiyou Wang Enabling Preserving Bisimulation Equivalence 10.4230/LIPIcs.CONCUR.2021.33
• Patrick Baillot, Alexis Ghyselen, and Naoki Kobayashi Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes 10.4230/LIPIcs.CONCUR.2021.34
• Rupak Majumdar, Madhavan Mukund, Felix Stutz, and Damien Zufferey Generalising Projection in Asynchronous Multiparty Session Types 10.4230/LIPIcs.CONCUR.2021.35
• Simon Fowler, Wen Kokke, Ornela Dardha, Sam Lindley, and J. Garrett Morris Separating Sessions Smoothly 10.4230/LIPIcs.CONCUR.2021.36