<h2>LIPIcs, Volume 311, CONCUR 2024</h2>
<ul>
<li>
<span class="authors">Rupak Majumdar and Alexandra Silva</span>
<span class="title">LIPIcs, Volume 311, CONCUR 2024, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024">10.4230/LIPIcs.CONCUR.2024</a>
</li>
<li>
<span class="authors">Rupak Majumdar and Alexandra Silva</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.0">10.4230/LIPIcs.CONCUR.2024.0</a>
</li>
<li>
<span class="authors">Arie Gurfinkel</span>
<span class="title">Constrained Horn Clauses for Program Verification and Synthesis (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.1">10.4230/LIPIcs.CONCUR.2024.1</a>
</li>
<li>
<span class="authors">Azalea Raad</span>
<span class="title">Principles of Persistent Programming (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.2">10.4230/LIPIcs.CONCUR.2024.2</a>
</li>
<li>
<span class="authors">Thomas Wies</span>
<span class="title">Verifying Concurrent Search Structures (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.3">10.4230/LIPIcs.CONCUR.2024.3</a>
</li>
<li>
<span class="authors">Luca Aceto, Antonis Achilleos, Elli Anastasiadi, Adrian Francalanza, Daniele Gorla, and Jana Wagemaker</span>
<span class="title">Centralized vs Decentralized Monitors for Hyperproperties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.4">10.4230/LIPIcs.CONCUR.2024.4</a>
</li>
<li>
<span class="authors">S. Akshay, Paul Gastin, R. Govind, and B. Srivathsan</span>
<span class="title">MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.5">10.4230/LIPIcs.CONCUR.2024.5</a>
</li>
<li>
<span class="authors">S. Akshay, Tobias Meggendorfer, and P. S. Thiagarajan</span>
<span class="title">Causally Deterministic Markov Decision Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.6">10.4230/LIPIcs.CONCUR.2024.6</a>
</li>
<li>
<span class="authors">Jesús Aranda, Sebastián Betancourt, Juan Fco. Díaz, and Frank Valencia</span>
<span class="title">Fairness and Consensus in an Asynchronous Opinion Model for Social Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.7">10.4230/LIPIcs.CONCUR.2024.7</a>
</li>
<li>
<span class="authors">Guy Avni, Ehsan Kafshdar Goharshady, Thomas A. Henzinger, and Kaushik Mallik</span>
<span class="title">Bidding Games with Charging</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.8">10.4230/LIPIcs.CONCUR.2024.8</a>
</li>
<li>
<span class="authors">Christel Baier, Jakob Piribauer, and Maximilian Starke</span>
<span class="title">Risk-Averse Optimization of Total Rewards in Markovian Models Using Deviation Measures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.9">10.4230/LIPIcs.CONCUR.2024.9</a>
</li>
<li>
<span class="authors">Mrudula Balachander, Emmanuel Filiot, and Raffaella Gentilini</span>
<span class="title">Passive Learning of Regular Data Languages in Polynomial Time and Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.10">10.4230/LIPIcs.CONCUR.2024.10</a>
</li>
<li>
<span class="authors">Paolo Baldan, Davide Castelnovo, Andrea Corradini, and Fabio Gadducci</span>
<span class="title">Left-Linear Rewriting in Adhesive Categories</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.11">10.4230/LIPIcs.CONCUR.2024.11</a>
</li>
<li>
<span class="authors">Udi Boker, Thomas A. Henzinger, Karoliina Lehtinen, and Aditya Prakash</span>
<span class="title">History-Determinism vs Fair Simulation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.12">10.4230/LIPIcs.CONCUR.2024.12</a>
</li>
<li>
<span class="authors">Sougata Bose, Rasmus Ibsen-Jensen, David Purser, Patrick Totzke, and Pierre Vandenhove</span>
<span class="title">The Power of Counting Steps in Quantitative Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.13">10.4230/LIPIcs.CONCUR.2024.13</a>
</li>
<li>
<span class="authors">Véronique Bruyère, Christophe Grandmont, and Jean-François Raskin</span>
<span class="title">As Soon as Possible but Rationally</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.14">10.4230/LIPIcs.CONCUR.2024.14</a>
</li>
<li>
<span class="authors">Valentina Castiglioni, Michele Loreti, and Simone Tini</span>
<span class="title">RobTL: Robustness Temporal Logic for CPS</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.15">10.4230/LIPIcs.CONCUR.2024.15</a>
</li>
<li>
<span class="authors">Lorenzo Ceragioli, Fabio Gadducci, Giuseppe Lomurno, and Gabriele Tedeschi</span>
<span class="title">Effect Semantics for Quantum Process Calculi</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.16">10.4230/LIPIcs.CONCUR.2024.16</a>
</li>
<li>
<span class="authors">Dmitry Chistikov, Jérôme Leroux, Henry Sinclair-Banks, and Nicolas Waldburger</span>
<span class="title">Invariants for One-Counter Automata with Disequality Tests</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.17">10.4230/LIPIcs.CONCUR.2024.17</a>
</li>
<li>
<span class="authors">Lorenzo Clemente</span>
<span class="title">Weighted Basic Parallel Processes and Combinatorial Enumeration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.18">10.4230/LIPIcs.CONCUR.2024.18</a>
</li>
<li>
<span class="authors">Philipp Czerner, Javier Esparza, Valentin Krasotin, and Christoph Welzel-Mohr</span>
<span class="title">Computing Inductive Invariants of Regular Abstraction Frameworks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.19">10.4230/LIPIcs.CONCUR.2024.19</a>
</li>
<li>
<span class="authors">Keri D'Angelo, Sebastian Gurke, Johanna Maria Kirss, Barbara König, Matina Najafi, Wojciech Różowski, and Paul Wild</span>
<span class="title">Behavioural Metrics: Compositionality of the Kantorovich Lifting and an Application to Up-To Techniques</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.20">10.4230/LIPIcs.CONCUR.2024.20</a>
</li>
<li>
<span class="authors">Luc Dartois, Paul Gastin, Loïc Germerie Guizouarn, R. Govind, and Shankaranarayanan Krishna</span>
<span class="title">Reversible Transducers over Infinite Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.21">10.4230/LIPIcs.CONCUR.2024.21</a>
</li>
<li>
<span class="authors">Romain Delpy, Anca Muscholl, and Grégoire Sutre</span>
<span class="title">An Automata-Based Approach for Synchronizable Mailbox Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.22">10.4230/LIPIcs.CONCUR.2024.22</a>
</li>
<li>
<span class="authors">Laurent Doyen and Thomas Soullard</span>
<span class="title">Regular Games with Imperfect Information Are Not That Regular</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.23">10.4230/LIPIcs.CONCUR.2024.23</a>
</li>
<li>
<span class="authors">Javier Esparza and Rubén Rubio</span>
<span class="title">Validity of Contextual Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.24">10.4230/LIPIcs.CONCUR.2024.24</a>
</li>
<li>
<span class="authors">Sergey Goncharov and Tarmo Uustalu</span>
<span class="title">A Unifying Categorical View of Nondeterministic Iteration and Tests</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.25">10.4230/LIPIcs.CONCUR.2024.25</a>
</li>
<li>
<span class="authors">Lucie Guillou, Arnaud Sangnier, and Nathalie Sznajder</span>
<span class="title">Phase-Bounded Broadcast Networks over Topologies of Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.26">10.4230/LIPIcs.CONCUR.2024.26</a>
</li>
<li>
<span class="authors">Quentin Guilmant and Joël Ouaknine</span>
<span class="title">Inaproximability in Weighted Timed Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.27">10.4230/LIPIcs.CONCUR.2024.27</a>
</li>
<li>
<span class="authors">Daniel Hausmann and Nir Piterman</span>
<span class="title">Faster and Smaller Solutions of Obliging Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.28">10.4230/LIPIcs.CONCUR.2024.28</a>
</li>
<li>
<span class="authors">Thomas A. Henzinger, Nicolas Mazzocchi, and N. Ege Saraç</span>
<span class="title">Strategic Dominance: A New Preorder for Nondeterministic Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.29">10.4230/LIPIcs.CONCUR.2024.29</a>
</li>
<li>
<span class="authors">Juan C. Jaramillo, Dan Frumin, and Jorge A. Pérez</span>
<span class="title">Around Classical and Intuitionistic Linear Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.30">10.4230/LIPIcs.CONCUR.2024.30</a>
</li>
<li>
<span class="authors">Łukasz Kamiński and Sławomir Lasota</span>
<span class="title">Bi-Reachability in Petri Nets with Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.31">10.4230/LIPIcs.CONCUR.2024.31</a>
</li>
<li>
<span class="authors">Stefan Kiefer and Qiyi Tang</span>
<span class="title">Minimising the Probabilistic Bisimilarity Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.32">10.4230/LIPIcs.CONCUR.2024.32</a>
</li>
<li>
<span class="authors">Aristotelis Koutsouridis, Michalis Kokologiannakis, and Viktor Vafeiadis</span>
<span class="title">Automating Memory Model Metatheory with Intersections</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.33">10.4230/LIPIcs.CONCUR.2024.33</a>
</li>
<li>
<span class="authors">Guillermo A. Pérez and Shrisha Rao</span>
<span class="title">On Continuous Pushdown VASS in One Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.34">10.4230/LIPIcs.CONCUR.2024.34</a>
</li>
<li>
<span class="authors">Simon Prucker and Lutz Schröder</span>
<span class="title">Nominal Tree Automata with Name Allocation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.35">10.4230/LIPIcs.CONCUR.2024.35</a>
</li>
<li>
<span class="authors">Gaspard Reghem and Rob J. van Glabbeek</span>
<span class="title">Branching Bisimilarity for Processes with Time-Outs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.36">10.4230/LIPIcs.CONCUR.2024.36</a>
</li>
<li>
<span class="authors">Timm Spork, Christel Baier, Joost-Pieter Katoen, Jakob Piribauer, and Tim Quatmann</span>
<span class="title">A Spectrum of Approximate Probabilistic Bisimulations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.37">10.4230/LIPIcs.CONCUR.2024.37</a>
</li>
<li>
<span class="authors">Myrthe S. C. Spronck, Bas Luttik, and Tim A. C. Willemse</span>
<span class="title">Progress, Justness and Fairness in Modal μ-Calculus Formulae</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.38">10.4230/LIPIcs.CONCUR.2024.38</a>
</li>
<li>
<span class="authors">Lara Stoltenow, Barbara König, Sven Schneider, Andrea Corradini, Leen Lambers, and Fernando Orejas</span>
<span class="title">Coinductive Techniques for Checking Satisfiability of Generalized Nested Conditions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.39">10.4230/LIPIcs.CONCUR.2024.39</a>
</li>
<li>
<span class="authors">Marnix Suilen, Marck van der Vegt, and Sebastian Junges</span>
<span class="title">A PSPACE Algorithm for Almost-Sure Rabin Objectives in Multi-Environment MDPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2024.40">10.4230/LIPIcs.CONCUR.2024.40</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