CONCUR 2005 – Concurrency Theory: 16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005. Proceedings

Dawson Engler (auth.), Martín Abadi, Luca de Alfaro (eds.)3540283099, 9783540283096

This volume contains the papers presented at CONCUR 2005, the 16th – ternational Conference on Concurrency Theory. The purpose of the CONCUR series of conferences is to bring together researchers,developers, and students in order to advance the theory of concurrency and to promote its applications. This year’s conference was in San Francisco, California, from August 23 to August 26. We received 100 submissions in response to a call for papers. Each subm- sionwasassignedto at leastthreemembers ofthe ProgramCommittee; in many cases, reviews were solicited from outside experts. The ProgramCommittee d- cussed the submissions electronically, judging them on their perceived imp- tance, originality, clarity, and appropriateness to the expected audience. The Program Committee selected 38 papers for presentation. Because of the format of the conference and the high number of submissions, many good papers could not be included. Although submissions werereadand evaluated, the papers that appear in this volume may di?er in form and contents from the corresponding submissions. It is expected that many of the papers will be further revised and submitted to refereed archival journals for publication.

---

Table of contents :
Front Matter….Pages –
Static Analysis Versus Model Checking for Bug Finding….Pages 1-1
The Benefits of Exposing Calls and Returns….Pages 2-3
A Compositional Approach to the Stochastic Dynamics of Gene Networks….Pages 4-4
Games Other People Play….Pages 5-5
Type-Directed Concurrency….Pages 6-20
Multiport Interaction Nets and Concurrency….Pages 21-35
Model Checking for π -Calculus Using Proof Search….Pages 36-50
A Game Semantics of the Asynchronous π -Calculus….Pages 51-65
Efficient On-the-Fly Algorithms for the Analysis of Timed Games….Pages 66-80
Modal Logics for Timed Control….Pages 81-94
Timed Shuffle Expressions….Pages 95-109
A New Modality for Almost Everywhere Properties in Timed Automata….Pages 110-124
The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation….Pages 125-140
A Behavioural Pseudometric for Metric Labelled Transition Systems….Pages 141-155
On Probabilistic Program Equivalence and Refinement….Pages 156-170
Probabilistic Anonymity….Pages 171-185
Secrecy Despite Compromise: Types, Cryptography, and the Pi-Calculus….Pages 186-201
Timed Spi-Calculus with Types for Secrecy and Authenticity….Pages 202-216
Selecting Theories and Recursive Protocols….Pages 217-232
Constraint Solving for Contract-Signing Protocols….Pages 233-247
A Ground-Complete Axiomatization of Finite State Processes in Process Algebra….Pages 248-262
Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP….Pages 263-277
Bisimulations Up-to for the Linear Time Branching Time Spectrum….Pages 278-292
Deriving Weak Bisimulation Congruences from Reduction Systems….Pages 293-307
SOS for Higher Order Processes….Pages 308-322
The Individual and Collective Token Interpretations of Petri Nets….Pages 323-337
Merged Processes — A New Condensed Representation of Petri Net Behaviour….Pages 338-352
Concurrent Clustered Programming….Pages 353-367
A Theory of System Behaviour in the Presence of Node and Link Failures….Pages 368-382
Comparing Two Approaches to Compensable Flow Composition….Pages 383-397
Transactions in RCCS….Pages 398-412
Two-Player Nonzero-Sum ω -Regular Games….Pages 413-427
Games Where You Can Play Optimally Without Any Memory….Pages 428-442
On Implementation of Global Concurrent Systems with Local Asynchronous Controllers….Pages 443-457
Defining Fairness….Pages 458-472
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems….Pages 473-487
Termination Analysis of Integer Linear Loops….Pages 488-502
A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs….Pages 503-517
Verification of Qualitative ℤ Constraints….Pages 518-532
Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces….Pages 533-547
Taming Interface Specifications….Pages 548-561
Synthesis of Distributed Systems from Knowledge-Based Specifications….Pages 562-576
Back Matter….Pages –