Abstract is missing.
- Laws of Programming: The Algebraic Unification of Theories of ConcurrencyTony Hoare. 1-6 [doi]
- The Benefits of Sometimes Not Being DiscreteJane Hillston. 7-22 [doi]
- Deterministic Negotiations: Concurrency for FreeJavier Esparza. 23-31 [doi]
- Generalized Bisimulation MetricsKonstantinos Chatzikokolakis, Daniel Gebler, Catuscia Palamidessi, Lili Xu. 32-46 [doi]
- Choreographies, LogicallyMarco Carbone, Fabrizio Montesi, Carsten Schürmann. 47-62 [doi]
- Deadlock Analysis of Unbounded Process NetworksElena Giachino, Naoki Kobayashi, Cosimo Laneve. 63-77 [doi]
- Trees from Functions as ProcessesDavide Sangiorgi, Xian Xu. 78-92 [doi]
- Bisimulations Up-to: Beyond First-Order Transition SystemsJean-Marie Madiot, Damien Pous, Davide Sangiorgi. 93-108 [doi]
- Parameterized Model Checking of Rendezvous SystemsBenjamin Aminof, Tomer Kotek, Sasha Rubin, Francesco Spegni, Helmut Veith. 109-124 [doi]
- On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: ReachabilityIgor Konnov, Helmut Veith, Josef Widder. 125-140 [doi]
- Lost in Abstraction: Monotonicity in Multi-threaded ProgramsAlexander Kaiser 0001, Daniel Kroening, Thomas Wahl. 141-155 [doi]
- Synthesis from Component Libraries with CostsGuy Avni, Orna Kupferman. 156-172 [doi]
- Compositional Controller Synthesis for Stochastic GamesNicolas Basset, Marta Z. Kwiatkowska, Clemens Wiltsche. 173-187 [doi]
- Synchronizing Strategies under Partial ObservabilityKim Guldstrand Larsen, Simon Laursen, Jirí Srba. 188-202 [doi]
- Probabilistic Robust Timed GamesYoussouf Oualhadj, Pierre-Alain Reynier, Ocan Sankur. 203-217 [doi]
- Perturbation Analysis in Verification of Discrete-Time Markov ChainsTaolue Chen, Yuan Feng, David S. Rosenblum, Guoxin Su. 218-233 [doi]
- Robust Synchronization in Markov Decision ProcessesLaurent Doyen 0001, Thierry Massart, Mahsa Shirmohammadi. 234-248 [doi]
- Probabilistic Bisimulation: Naturally on DistributionsHolger Hermanns, Jan Krcál, Jan Kretínský. 249-265 [doi]
- Averaging in LTLPatricia Bouyer, Nicolas Markey, Raj Mohan Matteplackel. 266-280 [doi]
- Decidable Topologies for Communicating Automata with FIFO and Bag ChannelsLorenzo Clemente, Frédéric Herbreteau, Grégoire Sutre. 281-296 [doi]
- Controllers for the Verification of Communicating Multi-pushdown SystemsCyriac Aiswarya, Paul Gastin, K. Narayan Kumar. 297-311 [doi]
- Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model CheckingKazuhide Yasukata, Naoki Kobayashi 0001, Kazutaka Matsuda. 312-326 [doi]
- A Linear-Time Algorithm for the Orbit Problem over Cyclic GroupsAnthony Widjaja Lin, Sanming Zhou. 327-341 [doi]
- A Nearly Optimal Upper Bound for the Self-Stabilization Time in Herman's AlgorithmYuan Feng, Lijun Zhang. 342-356 [doi]
- Bounds on MobilityReiner Hüchting, Rupak Majumdar, Roland Meyer. 357-371 [doi]
- Typing Messages for Free in Security Protocols: The Case of Equivalence PropertiesRémy Chrétien, Véronique Cortier, Stéphanie Delaune. 372-386 [doi]
- Using Higher-Order Contracts to Model Session Types (Extended Abstract)Giovanni Bernardi, Matthew Hennessy. 387-401 [doi]
- A Semantic Deconstruction of Session TypesMassimo Bartoletti, Alceste Scalas, Roberto Zunino. 402-418 [doi]
- Timed Multiparty Session TypesLaura Bocchi, Weizhen Yang, Nobuko Yoshida. 419-434 [doi]
- A Categorical Semantics of Signal Flow GraphsFilippo Bonchi, Pawel Sobocinski, Fabio Zanasi. 435-450 [doi]
- Generic Forward and Backward Simulations III: Quantitative Simulations by MatricesNatsuki Urabe, Ichiro Hasuo. 451-466 [doi]
- A General Framework for Well-Structured Graph Transformation SystemsBarbara König, Jan Stückrath. 467-481 [doi]
- (Un)decidable Problems about Reachability of Quantum SystemsYangjia Li, Mingsheng Ying. 482-496 [doi]
- Ordered Navigation on Multi-attributed Data WordsNormann Decker, Peter Habermehl, Martin Leucker, Daniel Thoma. 497-511 [doi]
- Verification for Timed Automata Extended with Unbounded Discrete Data StructuresKarin Quaas. 512-526 [doi]
- Reducing Clocks in Timed Automata while Preserving BisimulationShibashis Guha, Chinmay Narayan, S. Arun-Kumar. 527-543 [doi]
- Qualitative Concurrent Parity Games: Bounded RationalityKrishnendu Chatterjee. 544-559 [doi]
- Adding Negative Prices to Priced Timed GamesThomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi. 560-575 [doi]
- Tight Game Abstractions of Probabilistic AutomataFalak Sher Vira, Joost-Pieter Katoen. 576-591 [doi]