CONCUR 2014 – Concurrency Theory

1. Front Matter

   PDF

2. 25th Anniversary Talk

   1. Laws of Programming: The Algebraic Unification of Theories of Concurrency

      • Tony Hoare

      Pages 1-6

3. Invited Talks

   1. The Benefits of Sometimes Not Being Discrete

      • Jane Hillston

      Pages 7-22

   2. Deterministic Negotiations: Concurrency for Free

      • Javier Esparza

      Pages 23-31

   3. Generalized Bisimulation Metrics

      • Konstantinos Chatzikokolakis, Daniel Gebler, Catuscia Palamidessi, Lili Xu

      Pages 32-46

4. Process Calculi

   1. Choreographies, Logically

      • Marco Carbone, Fabrizio Montesi, Carsten Schürmann

      Pages 47-62

   2. Deadlock Analysis of Unbounded Process Networks

      • Elena Giachino, Naoki Kobayashi, Cosimo Laneve

      Pages 63-77

   3. Trees from Functions as Processes

      • Davide Sangiorgi, Xian Xu

      Pages 78-92

   4. Bisimulations Up-to: Beyond First-Order Transition Systems

      • Jean-Marie Madiot, Damien Pous, Davide Sangiorgi

      Pages 93-108

5. Model Checking and Abstraction

   1. Parameterized Model Checking of Rendezvous Systems

      • Benjamin Aminof, Tomer Kotek, Sasha Rubin, Francesco Spegni, Helmut Veith

      Pages 109-124

   2. On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability

      • Igor Konnov, Helmut Veith, Josef Widder

      Pages 125-140

   3. Lost in Abstraction: Monotonicity in Multi-threaded Programs

      • Alexander Kaiser, Daniel Kroening, Thomas Wahl

      Pages 141-155

6. Synthesis

   1. Synthesis from Component Libraries with Costs

      • Guy Avni, Orna Kupferman

      Pages 156-172

   2. Compositional Controller Synthesis for Stochastic Games

      • Nicolas Basset, Marta Kwiatkowska, Clemens Wiltsche

      Pages 173-187

   3. Synchronizing Strategies under Partial Observability

      • Kim Guldstrand Larsen, Simon Laursen, Jiří Srba

      Pages 188-202

   4. Probabilistic Robust Timed Games

      • Youssouf Oualhadj, Pierre-Alain Reynier, Ocan Sankur

      Pages 203-217

7. Quantitative Models

   1. Perturbation Analysis in Verification of Discrete-Time Markov Chains

      • Taolue Chen, Yuan Feng, David S. Rosenblum, Guoxin Su

      Pages 218-233

   2. Robust Synchronization in Markov Decision Processes

      • Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi

      Pages 234-248

   3. Probabilistic Bisimulation: Naturally on Distributions

      • Holger Hermanns, Jan Krčál, Jan Křetínský

      Pages 249-265

   4. Averaging in LTL

      • Patricia Bouyer, Nicolas Markey, Raj Mohan Matteplackel

      Pages 266-280

This book constitutes the refereed proceedings of the 25th International Conference on Concurrency Theory, CONCUR 2014, held in Rome, Italy in September 2014. The 35 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 124 submissions. The focus of the conference is on the following topics: process calculi, model checking and abstraction, synthesis, quantitative models, automata and multithreading, complexity, process calculi and types, categories, graphs and quantum systems, automata and time, and games.

• Markov chains
• concurrent games
• concurrent processes
• distributed computing
• model checking
• probabilistic automata
• programming languages
• reactive systems
• simulation
• systems analysis
• temporal logics
• undecidability
• verification

• Department of Mathematics, University of Padova, Padova, Italy

  Paolo Baldan

• Department of Computer Science, University of Roma “La Sapienza”, Rome, Italy

  Daniele Gorla

Policies and ethics