CONCUR 2014 – Concurrency Theory

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Laws of Programming: The Algebraic Unification of Theories of Concurrency
3. Altmetric Badge
   Chapter 2 The Benefits of Sometimes Not Being Discrete
4. Altmetric Badge
   Chapter 3 Deterministic Negotiations: Concurrency for Free
5. Altmetric Badge
   Chapter 4 Generalized Bisimulation Metrics
6. Altmetric Badge
   Chapter 5 Choreographies, Logically
7. Altmetric Badge
   Chapter 6 Deadlock Analysis of Unbounded Process Networks
8. Altmetric Badge
   Chapter 7 Trees from Functions as Processes
9. Altmetric Badge
   Chapter 8 Bisimulations Up-to: Beyond First-Order Transition Systems
10. Altmetric Badge
    Chapter 9 CONCUR 2014 – Concurrency Theory
11. Altmetric Badge
    Chapter 10 On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability
12. Altmetric Badge
    Chapter 11 Lost in Abstraction: Monotonicity in Multi-threaded Programs
13. Altmetric Badge
    Chapter 12 Synthesis from Component Libraries with Costs
14. Altmetric Badge
    Chapter 13 Compositional Controller Synthesis for Stochastic Games
15. Altmetric Badge
    Chapter 14 Synchronizing Strategies under Partial Observability
16. Altmetric Badge
    Chapter 15 Probabilistic Robust Timed Games
17. Altmetric Badge
    Chapter 16 Perturbation Analysis in Verification of Discrete-Time Markov Chains
18. Altmetric Badge
    Chapter 17 Robust Synchronization in Markov Decision Processes
19. Altmetric Badge
    Chapter 18 Probabilistic Bisimulation: Naturally on Distributions
20. Altmetric Badge
    Chapter 19 Averaging in LTL
21. Altmetric Badge
    Chapter 20 Decidable Topologies for Communicating Automata with FIFO and Bag Channels
22. Altmetric Badge
    Chapter 21 Controllers for the Verification of Communicating Multi-pushdown Systems
23. Altmetric Badge
    Chapter 22 Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking
24. Altmetric Badge
    Chapter 23 A Linear-Time Algorithm for the Orbit Problem over Cyclic Groups
25. Altmetric Badge
    Chapter 24 A Nearly Optimal Upper Bound for the Self-Stabilization Time in Herman’s Algorithm
26. Altmetric Badge
    Chapter 25 Bounds on Mobility
27. Altmetric Badge
    Chapter 26 Typing Messages for Free in Security Protocols: The Case of Equivalence Properties
28. Altmetric Badge
    Chapter 27 Using Higher-Order Contracts to Model Session Types (Extended Abstract)
29. Altmetric Badge
    Chapter 28 A Semantic Deconstruction of Session Types
30. Altmetric Badge
    Chapter 29 CONCUR 2014 – Concurrency Theory
31. Altmetric Badge
    Chapter 30 A Categorical Semantics of Signal Flow Graphs
32. Altmetric Badge
    Chapter 31 Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices
33. Altmetric Badge
    Chapter 32 A General Framework for Well-Structured Graph Transformation Systems
34. Altmetric Badge
    Chapter 33 (Un)decidable Problems about Reachability of Quantum Systems
35. Altmetric Badge
    Chapter 34 Ordered Navigation on Multi-attributed Data Words
36. Altmetric Badge
    Chapter 35 Verification for Timed Automata Extended with Unbounded Discrete Data Structures
37. Altmetric Badge
    Chapter 36 Reducing Clocks in Timed Automata while Preserving Bisimulation
38. Altmetric Badge
    Chapter 37 Qualitative Concurrent Parity Games: Bounded Rationality
39. Altmetric Badge
    Chapter 38 Adding Negative Prices to Priced Timed Games
40. Altmetric Badge
    Chapter 39 Tight Game Abstractions of Probabilistic Automata