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