<h2>LIPIcs, Volume 243, CONCUR 2022</h2>
<ul>
<li>
<span class="authors">Bartek Klin, Sławomir Lasota, and Anca Muscholl</span>
<span class="title">LIPIcs, Volume 243, CONCUR 2022, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022">10.4230/LIPIcs.CONCUR.2022</a>
</li>
<li>
<span class="authors">Bartek Klin, Sławomir Lasota, and Anca Muscholl</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.0">10.4230/LIPIcs.CONCUR.2022.0</a>
</li>
<li>
<span class="authors">Ilaria Castellani, Paul Gastin, Orna Kupferman, Mickael Randour, and Davide Sangiorgi</span>
<span class="title">CONCUR Test-Of-Time Award 2022 (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.1">10.4230/LIPIcs.CONCUR.2022.1</a>
</li>
<li>
<span class="authors">Philippa Gardner</span>
<span class="title">Concurrent Separation Logics: Logical Abstraction, Logical Atomicity and Environment Liveness Conditions (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.2">10.4230/LIPIcs.CONCUR.2022.2</a>
</li>
<li>
<span class="authors">Sergio Rajsbaum</span>
<span class="title">Distributed Decision Problems: Concurrent Specifications Beyond Binary Relations (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.3">10.4230/LIPIcs.CONCUR.2022.3</a>
</li>
<li>
<span class="authors">Jiarui Gan, Rupak Majumdar, Goran Radanovic, and Adish Singla</span>
<span class="title">Sequential Decision Making With Information Asymmetry (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.4">10.4230/LIPIcs.CONCUR.2022.4</a>
</li>
<li>
<span class="authors">Wojciech Czerwiński</span>
<span class="title">Involved VASS Zoo (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.5">10.4230/LIPIcs.CONCUR.2022.5</a>
</li>
<li>
<span class="authors">Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, and Bas Luttik</span>
<span class="title">On the Axiomatisation of Branching Bisimulation Congruence over CCS</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.6">10.4230/LIPIcs.CONCUR.2022.6</a>
</li>
<li>
<span class="authors">Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, and Alan Schmitt</span>
<span class="title">Non-Deterministic Abstract Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.7">10.4230/LIPIcs.CONCUR.2022.7</a>
</li>
<li>
<span class="authors">Victor Khomenko, Maciej Koutny, and Alex Yakovlev</span>
<span class="title">Slimming down Petri Boxes: Compact Petri Net Models of Control Flows</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.8">10.4230/LIPIcs.CONCUR.2022.8</a>
</li>
<li>
<span class="authors">Oscar Darwin and Stefan Kiefer</span>
<span class="title">On the Sequential Probability Ratio Test in Hidden Markov Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.9">10.4230/LIPIcs.CONCUR.2022.9</a>
</li>
<li>
<span class="authors">Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, David Purser, Markus A. Whiteland, and James Worrell</span>
<span class="title">Parameter Synthesis for Parametric Probabilistic Dynamical Systems and Prefix-Independent Specifications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.10">10.4230/LIPIcs.CONCUR.2022.10</a>
</li>
<li>
<span class="authors">Kush Grover, Jan Křetínský, Tobias Meggendorfer, and Maximilian Weininger</span>
<span class="title">Anytime Guarantees for Reachability in Uncountable Markov Decision Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.11">10.4230/LIPIcs.CONCUR.2022.11</a>
</li>
<li>
<span class="authors">Frédéric Herbreteau, B. Srivathsan, and Igor Walukiewicz</span>
<span class="title">Checking Timed Büchi Automata Emptiness Using the Local-Time Semantics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.12">10.4230/LIPIcs.CONCUR.2022.12</a>
</li>
<li>
<span class="authors">S. Akshay, Paul Gastin, R. Govind, and B. Srivathsan</span>
<span class="title">Simulations for Event-Clock Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.13">10.4230/LIPIcs.CONCUR.2022.13</a>
</li>
<li>
<span class="authors">Thomas A. Henzinger, Karoliina Lehtinen, and Patrick Totzke</span>
<span class="title">History-Deterministic Timed Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.14">10.4230/LIPIcs.CONCUR.2022.14</a>
</li>
<li>
<span class="authors">Benjamin Monmege, Julie Parreaux, and Pierre-Alain Reynier</span>
<span class="title">Decidability of One-Clock Weighted Timed Games with Arbitrary Weights</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.15">10.4230/LIPIcs.CONCUR.2022.15</a>
</li>
<li>
<span class="authors">Wojciech Czerwiński and Piotr Hofman</span>
<span class="title">Language Inclusion for Boundedly-Ambiguous Vector Addition Systems Is Decidable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.16">10.4230/LIPIcs.CONCUR.2022.16</a>
</li>
<li>
<span class="authors">A. R. Balasubramanian</span>
<span class="title">Complexity of Coverability in Depth-Bounded Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.17">10.4230/LIPIcs.CONCUR.2022.17</a>
</li>
<li>
<span class="authors">Shaull Almagor and Asaf Yeshurun</span>
<span class="title">Determinization of One-Counter Nets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.18">10.4230/LIPIcs.CONCUR.2022.18</a>
</li>
<li>
<span class="authors">Orna Kupferman and Naama Shamash Halevy</span>
<span class="title">Energy Games with Resource-Bounded Environments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.19">10.4230/LIPIcs.CONCUR.2022.19</a>
</li>
<li>
<span class="authors">Patricia Bouyer, Antonio Casares, Mickael Randour, and Pierre Vandenhove</span>
<span class="title">Half-Positional Objectives Recognized by Deterministic Büchi Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.20">10.4230/LIPIcs.CONCUR.2022.20</a>
</li>
<li>
<span class="authors">Emmanuel Filiot and Edwin Hamel-de le Court</span>
<span class="title">Two-Player Boundedness Counter Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.21">10.4230/LIPIcs.CONCUR.2022.21</a>
</li>
<li>
<span class="authors">James C. A. Main and Mickael Randour</span>
<span class="title">Different Strokes in Randomised Strategies: Revisiting Kuhn’s Theorem Under Finite-Memory Assumptions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.22">10.4230/LIPIcs.CONCUR.2022.22</a>
</li>
<li>
<span class="authors">Javier Esparza, Mikhail Raskin, and Christoph Welzel</span>
<span class="title">Regular Model Checking Upside-Down: An Invariant-Based Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.23">10.4230/LIPIcs.CONCUR.2022.23</a>
</li>
<li>
<span class="authors">Marius Bozga, Lucas Bueri, and Radu Iosif</span>
<span class="title">On an Invariance Problem for Parameterized Concurrent Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.24">10.4230/LIPIcs.CONCUR.2022.24</a>
</li>
<li>
<span class="authors">Ira Fesefeldt, Joost-Pieter Katoen, and Thomas Noll</span>
<span class="title">Towards Concurrent Quantitative Separation Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.25">10.4230/LIPIcs.CONCUR.2022.25</a>
</li>
<li>
<span class="authors">Damien Pous and Jana Wagemaker</span>
<span class="title">Completeness Theorems for Kleene Algebra with Top</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.26">10.4230/LIPIcs.CONCUR.2022.26</a>
</li>
<li>
<span class="authors">Laura Bozzelli, Adriano Peron, and César Sánchez</span>
<span class="title">Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.27">10.4230/LIPIcs.CONCUR.2022.27</a>
</li>
<li>
<span class="authors">Bharat Adsul, Paul Gastin, Saptarshi Sarkar, and Pascal Weil</span>
<span class="title">Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.28">10.4230/LIPIcs.CONCUR.2022.28</a>
</li>
<li>
<span class="authors">Uli Fahrenberg, Christian Johansen, Georg Struth, and Krzysztof Ziemiański</span>
<span class="title">A Kleene Theorem for Higher-Dimensional Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.29">10.4230/LIPIcs.CONCUR.2022.29</a>
</li>
<li>
<span class="authors">Clément Aubert, Ross Horne, and Christian Johansen</span>
<span class="title">Diamonds for Security: A Non-Interleaving Operational Semantics for the Applied Pi-Calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.30">10.4230/LIPIcs.CONCUR.2022.30</a>
</li>
<li>
<span class="authors">Brijesh Dongol, Gerhard Schellhorn, and Heike Wehrheim</span>
<span class="title">Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.31">10.4230/LIPIcs.CONCUR.2022.31</a>
</li>
<li>
<span class="authors">Stefan Kiefer and Qiyi Tang</span>
<span class="title">Strategies for MDP Bisimilarity Equivalence and Inequivalence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.32">10.4230/LIPIcs.CONCUR.2022.32</a>
</li>
<li>
<span class="authors">Véronique Bruyère, Jean-François Raskin, and Clément Tamines</span>
<span class="title">Pareto-Rational Verification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.33">10.4230/LIPIcs.CONCUR.2022.33</a>
</li>
<li>
<span class="authors">Shaull Almagor and Shai Guendelman</span>
<span class="title">Concurrent Games with Multiple Topologies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.34">10.4230/LIPIcs.CONCUR.2022.34</a>
</li>
<li>
<span class="authors">Adam D. Barwell, Alceste Scalas, Nobuko Yoshida, and Fangyi Zhou</span>
<span class="title">Generalised Multiparty Session Types with Crash-Stop Failures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.35">10.4230/LIPIcs.CONCUR.2022.35</a>
</li>
<li>
<span class="authors">Luca Ciccone and Luca Padovani</span>
<span class="title">An Infinitary Proof Theory of Linear Logic Ensuring Fair Termination in the Linear π-Calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.36">10.4230/LIPIcs.CONCUR.2022.36</a>
</li>
<li>
<span class="authors">Ugo Dal Lago and Giulia Giusti</span>
<span class="title">On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2022.37">10.4230/LIPIcs.CONCUR.2022.37</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