<h2>LIPIcs, Volume 279, CONCUR 2023</h2>
<ul>
<li>
<span class="authors">Guillermo A. Pérez and Jean-François Raskin</span>
<span class="title">LIPIcs, Volume 279, CONCUR 2023, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023">10.4230/LIPIcs.CONCUR.2023</a>
</li>
<li>
<span class="authors">Guillermo A. Pérez and Jean-François Raskin</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.0">10.4230/LIPIcs.CONCUR.2023.0</a>
</li>
<li>
<span class="authors">Bengt Jonsson, Marta Kwiatkowska, and Igor Walukiewicz</span>
<span class="title">CONCUR Test-Of-Time Award 2023 (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.1">10.4230/LIPIcs.CONCUR.2023.1</a>
</li>
<li>
<span class="authors">Ahmed Bouajjani</span>
<span class="title">On Verifying Concurrent Programs Under Weakly Consistent Models (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.2">10.4230/LIPIcs.CONCUR.2023.2</a>
</li>
<li>
<span class="authors">Jakub Michaliszyn, Jan Otop, and Piotr Wieczorek</span>
<span class="title">Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.3">10.4230/LIPIcs.CONCUR.2023.3</a>
</li>
<li>
<span class="authors">P. H. M. van Spaendonck and Tim A. C. Willemse</span>
<span class="title">The Best of Both Worlds: Model-Driven Engineering Meets Model-Based Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.4">10.4230/LIPIcs.CONCUR.2023.4</a>
</li>
<li>
<span class="authors">Myrthe S. C. Spronck and Bas Luttik</span>
<span class="title">Process-Algebraic Models of Multi-Writer Multi-Reader Non-Atomic Registers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.5">10.4230/LIPIcs.CONCUR.2023.5</a>
</li>
<li>
<span class="authors">Roland Guttenberg, Mikhail Raskin, and Javier Esparza</span>
<span class="title">Geometry of Reachability Sets of Vector Addition Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.6">10.4230/LIPIcs.CONCUR.2023.6</a>
</li>
<li>
<span class="authors">Lucie Guillou, Arnaud Sangnier, and Nathalie Sznajder</span>
<span class="title">Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.7">10.4230/LIPIcs.CONCUR.2023.7</a>
</li>
<li>
<span class="authors">Eren Keskin and Roland Meyer</span>
<span class="title">Separability and Non-Determinizability of WSTS</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.8">10.4230/LIPIcs.CONCUR.2023.8</a>
</li>
<li>
<span class="authors">Åsmund Aqissiaq Arild Kløvstad, Eduard Kamburjan, and Einar Broch Johnsen</span>
<span class="title">Compositional Correctness and Completeness for Symbolic Partial Order Reduction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.9">10.4230/LIPIcs.CONCUR.2023.9</a>
</li>
<li>
<span class="authors">Pascal Baumann, Khushraj Madnani, Filip Mazowiecki, and Georg Zetzsche</span>
<span class="title">Monus Semantics in Vector Addition Systems with States</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.10">10.4230/LIPIcs.CONCUR.2023.10</a>
</li>
<li>
<span class="authors">Gil Silva, Andreia Mordido, and Vasco T. Vasconcelos</span>
<span class="title">Subtyping Context-Free Session Types</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.11">10.4230/LIPIcs.CONCUR.2023.11</a>
</li>
<li>
<span class="authors">Michal Ajdarów and Antonín Kučera</span>
<span class="title">Asymptotic Complexity Estimates for Probabilistic Programs and Their VASS Abstractions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.12">10.4230/LIPIcs.CONCUR.2023.12</a>
</li>
<li>
<span class="authors">Christoph Haase and Radosław Piórkowski</span>
<span class="title">Universal Quantification Makes Automatic Structures Hard to Decide</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.13">10.4230/LIPIcs.CONCUR.2023.13</a>
</li>
<li>
<span class="authors">Alain Finkel, Serge Haddad, and Lina Ye</span>
<span class="title">About Decisiveness of Dynamic Probabilistic Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.14">10.4230/LIPIcs.CONCUR.2023.14</a>
</li>
<li>
<span class="authors">Anna Schmitt and Kirstin Peters</span>
<span class="title">Probabilistic Operational Correspondence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.15">10.4230/LIPIcs.CONCUR.2023.15</a>
</li>
<li>
<span class="authors">Guy Avni, Pranav Ghorpade, and Shibashis Guha</span>
<span class="title">A Game of Pawns</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.16">10.4230/LIPIcs.CONCUR.2023.16</a>
</li>
<li>
<span class="authors">Udi Boker, Thomas A. Henzinger, Nicolas Mazzocchi, and N. Ege Saraç</span>
<span class="title">Safety and Liveness of Quantitative Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.17">10.4230/LIPIcs.CONCUR.2023.17</a>
</li>
<li>
<span class="authors">Sougata Bose, David Purser, and Patrick Totzke</span>
<span class="title">History-Deterministic Vector Addition Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.18">10.4230/LIPIcs.CONCUR.2023.18</a>
</li>
<li>
<span class="authors">Orna Kupferman and Noam Shenwald</span>
<span class="title">Games with Trading of Control</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.19">10.4230/LIPIcs.CONCUR.2023.19</a>
</li>
<li>
<span class="authors">Radu Iosif and Florian Zuleger</span>
<span class="title">Expressiveness Results for an Inductive Logic of Separated Relations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.20">10.4230/LIPIcs.CONCUR.2023.20</a>
</li>
<li>
<span class="authors">Ezio Bartocci, Thomas A. Henzinger, Dejan Nickovic, and Ana Oliveira da Costa</span>
<span class="title">Hypernode Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.21">10.4230/LIPIcs.CONCUR.2023.21</a>
</li>
<li>
<span class="authors">Alessandro Abate, Alec Edwards, Mirco Giacobbe, Hashan Punchihewa, and Diptarko Roy</span>
<span class="title">Quantitative Verification with Neural Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.22">10.4230/LIPIcs.CONCUR.2023.22</a>
</li>
<li>
<span class="authors">Shankara Narayanan Krishna, Khushraj Nanik Madnani, Rupak Majumdar, and Paritosh Pandya</span>
<span class="title">Satisfiability Checking of Multi-Variable TPTL with Unilateral Intervals Is PSPACE-Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.23">10.4230/LIPIcs.CONCUR.2023.23</a>
</li>
<li>
<span class="authors">Corto Mascle, Anca Muscholl, and Igor Walukiewicz</span>
<span class="title">Model-Checking Parametric Lock-Sharing Systems Against Regular Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.24">10.4230/LIPIcs.CONCUR.2023.24</a>
</li>
<li>
<span class="authors">Azalea Raad, Julien Vanegue, Josh Berdine, and Peter O'Hearn</span>
<span class="title">A General Approach to Under-Approximate Reasoning About Concurrent Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.25">10.4230/LIPIcs.CONCUR.2023.25</a>
</li>
<li>
<span class="authors">Omri Isac, Yoni Zohar, Clark Barrett, and Guy Katz</span>
<span class="title">DNN Verification, Reachability, and the Exponential Function Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.26">10.4230/LIPIcs.CONCUR.2023.26</a>
</li>
<li>
<span class="authors">Hagit Attiya, Constantin Enea, and Shafik Nassar</span>
<span class="title">Faithful Simulation of Randomized BFT Protocols on Block DAGs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.27">10.4230/LIPIcs.CONCUR.2023.27</a>
</li>
<li>
<span class="authors">Jan Friso Groote and Tim A. C. Willemse</span>
<span class="title">Real Equation Systems with Alternating Fixed-Points</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.28">10.4230/LIPIcs.CONCUR.2023.28</a>
</li>
<li>
<span class="authors">Stéphane Demri and Karin Quaas</span>
<span class="title">Constraint Automata on Infinite Data Trees: from CTL(ℤ)/CTL^*(ℤ) to Decision Procedures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.29">10.4230/LIPIcs.CONCUR.2023.29</a>
</li>
<li>
<span class="authors">Jesús Domínguez and Aleksandar Nanevski</span>
<span class="title">Visibility and Separability for a Declarative Linearizability Proof of the Timestamped Stack</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.30">10.4230/LIPIcs.CONCUR.2023.30</a>
</li>
<li>
<span class="authors">Enzo Erlich, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, and Martin Zimmermann</span>
<span class="title">History-Deterministic Parikh Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.31">10.4230/LIPIcs.CONCUR.2023.31</a>
</li>
<li>
<span class="authors">Jan Martens and Jan Friso Groote</span>
<span class="title">Computing Minimal Distinguishing Hennessy-Milner Formulas is NP-Hard, but Variants are Tractable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.32">10.4230/LIPIcs.CONCUR.2023.32</a>
</li>
<li>
<span class="authors">Clément Bertrand, Cinzia Di Giusto, Hanna Klaudel, and Damien Regnault</span>
<span class="title">Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.33">10.4230/LIPIcs.CONCUR.2023.33</a>
</li>
<li>
<span class="authors">Tiange Liu, Alwen Tiu, and Jim de Groot</span>
<span class="title">Modal Logics for Mobile Processes Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.34">10.4230/LIPIcs.CONCUR.2023.34</a>
</li>
<li>
<span class="authors">Sven Schewe, Qiyi Tang, and Tansholpan Zhanabekova</span>
<span class="title">Deciding What Is Good-For-MDPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.35">10.4230/LIPIcs.CONCUR.2023.35</a>
</li>
<li>
<span class="authors">Petr Jančar and Jérôme Leroux</span>
<span class="title">The Semilinear Home-Space Problem Is Ackermann-Complete for Petri Nets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.36">10.4230/LIPIcs.CONCUR.2023.36</a>
</li>
<li>
<span class="authors">Yong Li, Sven Schewe, and Moshe Y. Vardi</span>
<span class="title">Singly Exponential Translation of Alternating Weak Büchi Automata to Unambiguous Büchi Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.37">10.4230/LIPIcs.CONCUR.2023.37</a>
</li>
<li>
<span class="authors">Ugo Dal Lago and Maurizio Murgia</span>
<span class="title">Contextual Behavioural Metrics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.38">10.4230/LIPIcs.CONCUR.2023.38</a>
</li>
<li>
<span class="authors">Ashwani Anand and Georg Zetzsche</span>
<span class="title">Priority Downward Closures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2023.39">10.4230/LIPIcs.CONCUR.2023.39</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