CONCUR 2014 - Concurrency Theory

Laws of Programming: The Algebraic Unification of Theories of Concurrency.- The Benefits of Sometimes Not Being Discrete.- Deterministic Negotiations: Concurrency for Free.- Generalized Bisimulation Metrics.- Choreographies, Logically.- Deadlock Analysis of Unbounded Process Networks.- Trees from Functions as Processes.- Bisimulations Up-to: Beyond First-Order Transition Systems.- Parameterized Model Checking of Rendezvous Systems.- On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability.- Lost in Abstraction: Monotonicity in Multi-threaded Programs.- Synthesis from Component Libraries with Costs.- Compositional Controller Synthesis for Stochastic Games.- Synchronizing Strategies under Partial Observability.- Probabilistic Robust Timed Games.- Perturbation Analysis in Verification of Discrete-Time Markov Chains.- Robust Synchronization in Markov Decision Processes.- Probabilistic Bisimulation: Naturally on Distributions.- Averaging in LTL.- Decidable Topologies for Communicating Automata with FIFO and Bag Channels.- Controllers for the Verification of Communicating Multi-pushdown Systems.- Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking.- A Linear-Time Algorithm for the Orbit Problem over Cyclic Groups.- A Nearly Optimal Upper Bound for the Self-Stabilization Time in Herman's Algorithm.- Bounds on Mobility.- Typing Messages for Free in Security Protocols: The Case of Equivalence Properties.- Using Higher-Order Contracts to Model Session Types (Extended Abstract).- A Semantic Deconstruction of Session Types.- Timed Multiparty Session Types.- A Categorical Semantics of Signal Flow Graphs.- Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices.- A General Framework for Well-Structured Graph Transformation Systems.- (Un)decidable Problems about Reachability of Quantum Systems.- Ordered Navigation on Multi-attributed Data Words.-Verification for