CONCUR 2005 - Concurrency Theory

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Static Analysis Versus Model Checking for Bug Finding
3. Altmetric Badge
   Chapter 2 The Benefits of Exposing Calls and Returns
4. Altmetric Badge
   Chapter 3 A Compositional Approach to the Stochastic Dynamics of Gene Networks
5. Altmetric Badge
   Chapter 4 Games Other People Play
6. Altmetric Badge
   Chapter 5 Type-Directed Concurrency
7. Altmetric Badge
   Chapter 6 Multiport Interaction Nets and Concurrency
8. Altmetric Badge
   Chapter 7 Model Checking for π -Calculus Using Proof Search
9. Altmetric Badge
   Chapter 8 A Game Semantics of the Asynchronous π -Calculus
10. Altmetric Badge
    Chapter 9 Efficient On-the-Fly Algorithms for the Analysis of Timed Games
11. Altmetric Badge
    Chapter 10 Modal Logics for Timed Control
12. Altmetric Badge
    Chapter 11 Timed Shuffle Expressions
13. Altmetric Badge
    Chapter 12 A New Modality for Almost Everywhere Properties in Timed Automata
14. Altmetric Badge
    Chapter 13 The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation
15. Altmetric Badge
    Chapter 14 A Behavioural Pseudometric for Metric Labelled Transition Systems
16. Altmetric Badge
    Chapter 15 On Probabilistic Program Equivalence and Refinement
17. Altmetric Badge
    Chapter 16 Probabilistic Anonymity
18. Altmetric Badge
    Chapter 17 Secrecy Despite Compromise: Types, Cryptography, and the Pi-Calculus
19. Altmetric Badge
    Chapter 18 Timed Spi-Calculus with Types for Secrecy and Authenticity
20. Altmetric Badge
    Chapter 19 Selecting Theories and Recursive Protocols
21. Altmetric Badge
    Chapter 20 Constraint Solving for Contract-Signing Protocols
22. Altmetric Badge
    Chapter 21 A Ground-Complete Axiomatization of Finite State Processes in Process Algebra
23. Altmetric Badge
    Chapter 22 Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP
24. Altmetric Badge
    Chapter 23 Bisimulations Up-to for the Linear Time Branching Time Spectrum
25. Altmetric Badge
    Chapter 24 Deriving Weak Bisimulation Congruences from Reduction Systems
26. Altmetric Badge
    Chapter 25 SOS for Higher Order Processes
27. Altmetric Badge
    Chapter 26 The Individual and Collective Token Interpretations of Petri Nets
28. Altmetric Badge
    Chapter 27 Merged Processes — A New Condensed Representation of Petri Net Behaviour
29. Altmetric Badge
    Chapter 28 Concurrent Clustered Programming
30. Altmetric Badge
    Chapter 29 A Theory of System Behaviour in the Presence of Node and Link Failures
31. Altmetric Badge
    Chapter 30 Comparing Two Approaches to Compensable Flow Composition
32. Altmetric Badge
    Chapter 31 Transactions in RCCS
33. Altmetric Badge
    Chapter 32 Two-Player Nonzero-Sum ω -Regular Games
34. Altmetric Badge
    Chapter 33 Games Where You Can Play Optimally Without Any Memory
35. Altmetric Badge
    Chapter 34 On Implementation of Global Concurrent Systems with Local Asynchronous Controllers
36. Altmetric Badge
    Chapter 35 Defining Fairness
37. Altmetric Badge
    Chapter 36 Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems
38. Altmetric Badge
    Chapter 37 Termination Analysis of Integer Linear Loops
39. Altmetric Badge
    Chapter 38 A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs
40. Altmetric Badge
    Chapter 39 Verification of Qualitative ℤ Constraints
41. Altmetric Badge
    Chapter 40 Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces
42. Altmetric Badge
    Chapter 41 Taming Interface Specifications
43. Altmetric Badge
    Chapter 42 Synthesis of Distributed Systems from Knowledge-Based Specifications