LIPIcs, Volume 348, CONCUR 2025
Patricia Bouyer and Jaco van de Pol, 36th International Conference on Concurrency Theory
LIPIcs, Volume 348, CONCUR 2025, Complete Volume 10.4230/LIPIcs.CONCUR.2025
Available online: https://www.dagstuhl.de/dagpub/978-3-95977-389-8
Invited Talks
Accepted Papers
- Luca Aceto, Antonis Achilleos, Duncan Paul Attard, Léo Exibard, Adrian Francalanza, Anna Ingólfsdóttir, and Karoliina Lehtinen,
Monitorability for the Modal Mu-Calculus over Systems with Data: From Practice to Theory.
10.4230/LIPIcs.CONCUR.2025.4 - Bharat Adsul, Paul Gastin, and Shantanu Kulkarni,
Characterizations of Fragments of Temporal Logic over Mazurkiewicz Traces.
10.4230/LIPIcs.CONCUR.2025.5 - S. Akshay, Ouldouz Neysari, and Ðorđe Žikelić,
Omega-Regular Verification and Control for Distributional Specifications in MDPs.
10.4230/LIPIcs.CONCUR.2025.6 - Pete Austin, Sougata Bose, Nicolas Mazzocchi, and Patrick Totzke,
Temporal Explorability Games.
10.4230/LIPIcs.CONCUR.2025.7 - Paolo Baldan, Roberto Bruni, Francesco Ranzato, and Diletta Rigo,
Model Checking as Program Verification by Abstract Interpretation.
10.4230/LIPIcs.CONCUR.2025.8 - Raphaël Berthon, Joost-Pieter Katoen, and Zihan Zhou,
A Direct Reduction from Stochastic Parity Games to Simple Stochastic Games.
10.4230/LIPIcs.CONCUR.2025.9 - Laura Bocchi, Andy King, Maurizio Murgia, and Simon Thompson,
Abstract Subtyping for Asynchronous Multiparty Sessions.
10.4230/LIPIcs.CONCUR.2025.10 - Mario Bravetti, Luca Padovani, and Gianluigi Zavattaro,
A Sound and Complete Characterization of Fair Asynchronous Session Subtyping.
10.4230/LIPIcs.CONCUR.2025.11 - Véronique Bruyère, Jean-François Raskin, Alexis Reynouard, and Marie Van Den Bogaard,
The Non-Cooperative Rational Synthesis Problem for SPEs and ω-Regular Objectives.
10.4230/LIPIcs.CONCUR.2025.12 - Wojciech Czerwiński and Łukasz Orlikowski,
Languages of Boundedly-Ambiguous Vector Addition Systems with States.
10.4230/LIPIcs.CONCUR.2025.13 - Luc Dartois, Paul Gastin, Loïc Germerie Guizouarn, and Shankaranarayanan Krishna,
Reversible Pebble Transducers.
10.4230/LIPIcs.CONCUR.2025.14 - Romain Delpy, Anca Muscholl, and Grégoire Sutre,
On the Send-Synchronizability Problem for Mailbox Communication.
10.4230/LIPIcs.CONCUR.2025.15 - Laurent Doyen, Pranshu Gaba, and Shibashis Guha,
Expectation in Stochastic Games with Prefix-Independent Objectives.
10.4230/LIPIcs.CONCUR.2025.16 - Rob van Glabbeek, Bas Luttik, and Myrthe S. C. Spronck,
Just Verification of Mutual Exclusion Algorithms.
10.4230/LIPIcs.CONCUR.2025.17 - Jan Friso Groote and David N. Jansen,
A State-Based O(m log n) Partitioning Algorithm for Branching Bisimilarity.
10.4230/LIPIcs.CONCUR.2025.18 - Thomas M. Grosen, Sean Kauffman, Kim G. Larsen, and Martin Zimmermann,
Time for Timed Monitorability.
10.4230/LIPIcs.CONCUR.2025.19 - Léo Henry, Mohammad Reza Mousavi, Thomas Neele, and Matteo Sammartino,
Compositional Active Learning of Synchronizing Systems Through Automated Alphabet Refinement.
10.4230/LIPIcs.CONCUR.2025.20 - Thomas A. Henzinger, Pavol Kebis, Nicolas Mazzocchi, and N. Ege Saraç,
Quantitative Language Automata.
10.4230/LIPIcs.CONCUR.2025.21 - Frédéric Herbreteau, Sarah Larroze-Jardiné, and Igor Walukiewicz,
Partial-Order Reduction Is Hard.
10.4230/LIPIcs.CONCUR.2025.22 - Daniel Hirschkoff, Iwan Quémerais, and Davide Sangiorgi,
First-Order Store and Visibility in Name-Passing Calculi.
10.4230/LIPIcs.CONCUR.2025.23 - Hsi-Ming Ho, Shankara Narayanan Krishna, Khushraj Madnani, Rupak Majumdar, and Paritosh Pandya,
Expressive Equivalence Between Decidable Freeze and Metric Timed Temporal Logics.
10.4230/LIPIcs.CONCUR.2025.24 - Nicolaj Ø. Jensen, Kim G. Larsen, Didier Lime, and Jiří Srba,
On-The-Fly Symbolic Algorithm for Timed ATL with Abstractions.
10.4230/LIPIcs.CONCUR.2025.25 - Mohammad Hossein Khoshechin Jorshari, Michalis Kokologiannakis, Rupak Majumdar, and Srinidhi Nagendra,
Optimal Concolic Dynamic Partial Order Reduction.
10.4230/LIPIcs.CONCUR.2025.26 - Orna Kupferman and Noam Shenwald,
Coverage Games.
10.4230/LIPIcs.CONCUR.2025.27 - François Laroussinie and Nicolas Markey,
Arbitrary-Arity Tree Automata for QCTL.
10.4230/LIPIcs.CONCUR.2025.28 - Caroline Lemke and Benjamin Bisping,
Galois Energy Games: To Solve All Kinds of Quantitative Reachability Problems.
10.4230/LIPIcs.CONCUR.2025.29 - Tiange Liu, Alwen Tiu, and Ross Horne,
Open Bisimilarity for the π-Calculus with Mismatch.
10.4230/LIPIcs.CONCUR.2025.30 - Hannah Mertens, Tim Quatmann, and Joost-Pieter Katoen,
Compositional Reasoning for Parametric Probabilistic Automata.
10.4230/LIPIcs.CONCUR.2025.31 - Soumyajit Paul, David Purser, Sven Schewe, Qiyi Tang, Patrick Totzke, and Di-De Yen,
Resolving Nondeterminism by Chance.
10.4230/LIPIcs.CONCUR.2025.32 - Yun Chen Tsai, Kittiphon Phalakarn, S. Akshay, and Ichiro Hasuo,
Chance and Mass Interpretations of Probabilities in Markov Decision Processes.
10.4230/LIPIcs.CONCUR.2025.33 - Frits Vaandrager and Ivo Melse,
New Fault Domains for Conformance Testing of Finite State Machines.
10.4230/LIPIcs.CONCUR.2025.34 - Rowin Versteeg, Valentina Castiglioni, and Bas Luttik,
From Bisimulation to Traces: The Impact of Parallel Composition on Finite Bases.
10.4230/LIPIcs.CONCUR.2025.35 - Emily Vlasman, Anto Nanah Ji, James Worrell, and Franck van Breugel,
Explainability is a Game for Probabilistic Bisimilarity Distances.
10.4230/LIPIcs.CONCUR.2025.36 - Sarah Winter and Martin Zimmermann,
Prophecies All the Way: Game-Based Model-Checking for HyperQPTL Beyond ∀*∃*.
10.4230/LIPIcs.CONCUR.2025.37 - Yangluo Zheng,
Reachability in Vector Addition System with States Parameterized by Geometric Dimension.
10.4230/LIPIcs.CONCUR.2025.38 - Noam Zilberstein, Daniele Gorla, and Alexandra Silva,
Denotational Semantics for Probabilistic and Concurrent Programs.
10.4230/LIPIcs.CONCUR.2025.39
