| 2025 | Denotational Semantics for Probabilistic and Concurrent Programs. | Noam Zilberstein, Daniele Gorla, Alexandra Silva |
| 2025 | Reachability in Vector Addition System with States Parameterized by Geometric Dimension. | Yangluo Zheng |
| 2025 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2025 | Prophecies All the Way: Game-Based Model-Checking for HyperQPTL Beyond ∀*∃*. | Sarah Winter, Martin Zimmermann |
| 2025 | Explainability is a Game for Probabilistic Bisimilarity Distances. | Emily Vlasman, Anto Nanah Ji, James Worrell, Franck van Breugel |
| 2025 | From Bisimulation to Traces: The Impact of Parallel Composition on Finite Bases. | Rowin Versteeg, Valentina Castiglioni, Bas Luttik |
| 2025 | New Fault Domains for Conformance Testing of Finite State Machines. | Frits W. Vaandrager, Ivo Melse |
| 2025 | Chance and Mass Interpretations of Probabilities in Markov Decision Processes. | Yun Chen Tsai, Kittiphon Phalakarn, S. Akshay, Ichiro Hasuo |
| 2025 | On-The-Fly Verification: Advancements in Dependency Graphs (Invited Talk). | Jir Srba |
| 2025 | Resolving Nondeterminism by Chance. | Soumyajit Paul, David Purser, Sven Schewe, Qiyi Tang, Patrick Totzke, Di-De Yen |
| 2025 | Compositional Reasoning for Parametric Probabilistic Automata. | Hannah Mertens, Tim Quatmann, Joost-Pieter Katoen |
| 2025 | Open Bisimilarity for the π-Calculus with Mismatch. | Tiange Liu, Alwen Tiu, Ross Horne |
| 2025 | Galois Energy Games: To Solve All Kinds of Quantitative Reachability Problems. | Caroline Lemke, Benjamin Bisping |
| 2025 | Arbitrary-Arity Tree Automata for QCTL. | Franois Laroussinie, Nicolas Markey |
| 2025 | Coverage Games. | Orna Kupferman, Noam Shenwald |
| 2025 | Optimal Concolic Dynamic Partial Order Reduction. | Mohammad Hossein Khoshechin Jorshari, Michalis Kokologiannakis, Rupak Majumdar, Srinidhi Nagendra |
| 2025 | On-The-Fly Symbolic Algorithm for Timed ATL with Abstractions. | Nicolaj . Jensen, Kim G. Larsen, Didier Lime, Jir Srba |
| 2025 | Expressive Equivalence Between Decidable Freeze and Metric Timed Temporal Logics. | Hsi-Ming Ho, Shankara Narayanan Krishna, Khushraj Madnani, Rupak Majumdar, Paritosh K. Pandya |
| 2025 | First-Order Store and Visibility in Name-Passing Calculi. | Daniel Hirschkoff, Iwan Qumerais, Davide Sangiorgi |
| 2025 | Towards Categorical Quantum Concurrency Theory (Invited Talk). | Chris Heunen |
| 2025 | Partial-Order Reduction Is Hard. | Frdric Herbreteau, Sarah Larroze-Jardin, Igor Walukiewicz |
| 2025 | Quantitative Language Automata. | Thomas A. Henzinger, Pavol Kebis, Nicolas Mazzocchi, N. Ege Sara |
| 2025 | Compositional Active Learning of Synchronizing Systems Through Automated Alphabet Refinement. | Lo Henry, Mohammad Reza Mousavi, Thomas Neele, Matteo Sammartino |
| 2025 | Time for Timed Monitorability. | Thomas Mller Grosen, Sean Kauffman, Kim G. Larsen, Martin Zimmermann |
| 2025 | A State-Based O(m log n) Partitioning Algorithm for Branching Bisimilarity. | Jan Friso Groote, David N. Jansen |