CONCUR 2014 – Concurrency Theory: 25th International Conference, CONCUR 2014, Rome, Italy, September 2-5, 2014. Proceedings (Lecture Notes in Computer Science, 8704)

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. Front Matter....Pages - Laws of Programming: The Algebraic Unification of Theories of Concurrency....Pages 1-6 The Benefits of Sometimes Not Being Discrete....Pages 7-22 Deterministic Negotiations: Concurrency for Free....Pages 23-31 Generalized Bisimulation Metrics....Pages 32-46 Choreographies, Logically....Pages 47-62 Deadlock Analysis of Unbounded Process Networks....Pages 63-77 Trees from Functions as Processes....Pages 78-92 Bisimulations Up-to: Beyond First-Order Transition Systems....Pages 93-108 Parameterized Model Checking of Rendezvous Systems....Pages 109-124 On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability....Pages 125-140 Lost in Abstraction: Monotonicity in Multi-threaded Programs....Pages 141-155 Synthesis from Component Libraries with Costs....Pages 156-172 Compositional Controller Synthesis for Stochastic Games....Pages 173-187 Synchronizing Strategies under Partial Observability....Pages 188-202 Probabilistic Robust Timed Games....Pages 203-217 Perturbation Analysis in Verification of Discrete-Time Markov Chains....Pages 218-233 Robust Synchronization in Markov Decision Processes....Pages 234-248 Probabilistic Bisimulation: Naturally on Distributions....Pages 249-265 Averaging in LTL ....Pages 266-280 Decidable Topologies for Communicating Automata with FIFO and Bag Channels....Pages 281-296 Controllers for the Verification of Communicating Multi-pushdown Systems....Pages 297-311 Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking....Pages 312-326 A Linear-Time Algorithm for the Orbit Problem over Cyclic Groups....Pages 327-341 A Nearly Optimal Upper Bound for the Self-Stabilization Time in Herman’s Algorithm....Pages 342-356 Bounds on Mobility....Pages 357-371 Typing Messages for Free in Security Protocols: The Case of Equivalence Properties....Pages 372-386 Using Higher-Order Contracts to Model Session Types (Extended Abstract)....Pages 387-401 A Semantic Deconstruction of Session Types....Pages 402-418 Timed Multiparty Session Types....Pages 419-434 A Categorical Semantics of Signal Flow Graphs....Pages 435-450 Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices....Pages 451-466 A General Framework for Well-Structured Graph Transformation Systems....Pages 467-481 (Un)decidable Problems about Reachability of Quantum Systems....Pages 482-496 Ordered Navigation on Multi-attributed Data Words....Pages 497-511 Verification for Timed Automata Extended with Unbounded Discrete Data Structures....Pages 512-526 Reducing Clocks in Timed Automata while Preserving Bisimulation....Pages 527-543 Qualitative Concurrent Parity Games: Bounded Rationality....Pages 544-559 Adding Negative Prices to Priced Timed Games....Pages 560-575 Tight Game Abstractions of Probabilistic Automata....Pages 576-591 Back Matter....Pages -