LIPIcs, Volume 311, CONCUR 2024

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