default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID36th CONCUR 2025: Aarhus, Denmark
- Patricia Bouyer
, Jaco van de Pol:
36th International Conference on Concurrency Theory, CONCUR 2025, August 26-29, 2025, Aarhus, Denmark. LIPIcs 348, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2025, ISBN 978-3-95977-389-8 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xii
- Christel Baier:
Linear Temporal Logic with Standpoint Modalities (Invited Talk). 1:1-1:1 - Chris Heunen:
Towards Categorical Quantum Concurrency Theory (Invited Talk). 2:1-2:1 - Jirí Srba:
On-The-Fly Verification: Advancements in Dependency Graphs (Invited Talk). 3:1-3:5 - Luca Aceto, Antonis Achilleos, Duncan Paul Attard, Léo Exibard, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen:
Monitorability for the Modal Mu-Calculus over Systems with Data: From Practice to Theory. 4:1-4:21 - Bharat Adsul, Paul Gastin, Shantanu Kulkarni:
Characterizations of Fragments of Temporal Logic over Mazurkiewicz Traces. 5:1-5:20 - S. Akshay, Ouldouz Neysari, Djorde Zikelic:
Omega-Regular Verification and Control for Distributional Specifications in MDPs. 6:1-6:19 - Pete Austin, Sougata Bose, Nicolas Mazzocchi, Patrick Totzke:
Temporal Explorability Games. 7:1-7:17 - Paolo Baldan, Roberto Bruni, Francesco Ranzato, Diletta Rigo:
Model Checking as Program Verification by Abstract Interpretation. 8:1-8:20 - Raphaël Berthon, Joost-Pieter Katoen, Zihan Zhou:
A Direct Reduction from Stochastic Parity Games to Simple Stochastic Games. 9:1-9:21 - Laura Bocchi, Andy King, Maurizio Murgia, Simon Thompson:
Abstract Subtyping for Asynchronous Multiparty Sessions. 10:1-10:19 - Mario Bravetti, Luca Padovani, Gianluigi Zavattaro:
A Sound and Complete Characterization of Fair Asynchronous Session Subtyping. 11:1-11:17 - Véronique Bruyère, Jean-François Raskin, Alexis Reynouard, Marie van den Bogaard:
The Non-Cooperative Rational Synthesis Problem for SPEs and ω-Regular Objectives. 12:1-12:23 - Wojciech Czerwinski, Lukasz Orlikowski:
Languages of Boundedly-Ambiguous Vector Addition Systems with States. 13:1-13:23 - Luc Dartois, Paul Gastin, Loïc Germerie Guizouarn, Shankaranarayanan Krishna:
Reversible Pebble Transducers. 14:1-14:22 - Romain Delpy, Anca Muscholl, Grégoire Sutre:
On the Send-Synchronizability Problem for Mailbox Communication. 15:1-15:20 - Laurent Doyen, Pranshu Gaba, Shibashis Guha:
Expectation in Stochastic Games with Prefix-Independent Objectives. 16:1-16:19 - Rob van Glabbeek, Bas Luttik, Myrthe S. C. Spronck:
Just Verification of Mutual Exclusion Algorithms. 17:1-17:25 - Jan Friso Groote, David N. Jansen:
A State-Based O(m log n) Partitioning Algorithm for Branching Bisimilarity. 18:1-18:16 - Thomas Møller Grosen, Sean Kauffman, Kim G. Larsen, Martin Zimmermann:
Time for Timed Monitorability. 19:1-19:20 - Léo Henry, Mohammad Reza Mousavi, Thomas Neele, Matteo Sammartino:
Compositional Active Learning of Synchronizing Systems Through Automated Alphabet Refinement. 20:1-20:22 - Thomas A. Henzinger, Pavol Kebis, Nicolas Mazzocchi, N. Ege Saraç:
Quantitative Language Automata. 21:1-21:24 - Frédéric Herbreteau, Sarah Larroze-Jardiné, Igor Walukiewicz:
Partial-Order Reduction Is Hard. 22:1-22:20 - Daniel Hirschkoff, Iwan Quémerais, Davide Sangiorgi:
First-Order Store and Visibility in Name-Passing Calculi. 23:1-23:21 - Hsi-Ming Ho, Shankara Narayanan Krishna, Khushraj Madnani, Rupak Majumdar, Paritosh K. Pandya:
Expressive Equivalence Between Decidable Freeze and Metric Timed Temporal Logics. 24:1-24:24 - Nicolaj Ø. Jensen, Kim G. Larsen, Didier Lime, Jirí Srba:
On-The-Fly Symbolic Algorithm for Timed ATL with Abstractions. 25:1-25:19 - Mohammad Hossein Khoshechin Jorshari, Michalis Kokologiannakis, Rupak Majumdar, Srinidhi Nagendra:
Optimal Concolic Dynamic Partial Order Reduction. 26:1-26:22 - Orna Kupferman, Noam Shenwald:
Coverage Games. 27:1-27:23 - François Laroussinie, Nicolas Markey:
Arbitrary-Arity Tree Automata for QCTL. 28:1-28:20 - Caroline Lemke, Benjamin Bisping:
Galois Energy Games: To Solve All Kinds of Quantitative Reachability Problems. 29:1-29:19 - Tiange Liu, Alwen Tiu, Ross Horne:
Open Bisimilarity for the π-Calculus with Mismatch. 30:1-30:20 - Hannah Mertens, Tim Quatmann, Joost-Pieter Katoen:
Compositional Reasoning for Parametric Probabilistic Automata. 31:1-31:20 - Soumyajit Paul, David Purser, Sven Schewe, Qiyi Tang, Patrick Totzke, Di-De Yen:
Resolving Nondeterminism by Chance. 32:1-32:22 - Yun Chen Tsai, Kittiphon Phalakarn, S. Akshay, Ichiro Hasuo:
Chance and Mass Interpretations of Probabilities in Markov Decision Processes. 33:1-33:19 - Frits W. Vaandrager, Ivo Melse:
New Fault Domains for Conformance Testing of Finite State Machines. 34:1-34:22 - Rowin Versteeg, Valentina Castiglioni, Bas Luttik:
From Bisimulation to Traces: The Impact of Parallel Composition on Finite Bases. 35:1-35:18 - Emily Vlasman, Anto Nanah Ji, James Worrell, Franck van Breugel:
Explainability is a Game for Probabilistic Bisimilarity Distances. 36:1-36:20 - Sarah Winter, Martin Zimmermann:
Prophecies All the Way: Game-Based Model-Checking for HyperQPTL Beyond ∀*∃. 37:1-37:18 - Yangluo Zheng:
Reachability in Vector Addition System with States Parameterized by Geometric Dimension. 38:1-38:18 - Noam Zilberstein, Daniele Gorla, Alexandra Silva:
Denotational Semantics for Probabilistic and Concurrent Programs. 39:1-39:24
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-21 06:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
