LIPIcs, Volume 279, CONCUR 2023

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