CONCUR 2006 – Concurrency Theory: 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006. Proceedings

Xiaojun Liu, Eleftherios Matsikoudis, Edward A. Lee (auth.), Christel Baier, Holger Hermanns (eds.)3540373764, 9783540373766

This volume contains the proceedings of the 17th International Conference on Concurrency Theory (CONCUR) held in Bonn, Germany, August 27–30, 2006. ThepurposeoftheCONCURconferenceseriesistobringtogetherresearchers, developers and students in order to advance the theory of concurrency and promote its applications. Interest in this topic is continuously growing,as a c- sequence of the importance and ubiquity of concurrent systems and their app- cations and the scienti?c relevance of their foundations. The scope of CONCUR covers all areas of semantics, logics, and veri?cation techniques for concurrent systems. Topics include basic models and logics of concurrent and distributed computation (such as process algebras, Petri nets, domain theoretic or game theoretic models, modal and temporal logics), specialized models or classes of systems (such as circuits, synchronous systems, real-time and hybrid systems, stochastic systems, databases, mobile and migrating systems, parametric pro- cols, security protocols), related veri?cation techniques and tools (such as sta- spaceexploration,model-checking,synthesis,abstraction,automated deduction, testing), and related programming models (such as distributed, constraint- or object-oriented,graphrewriting,aswellasassociatedtypesystems,staticana- ses, abstract machines, and environments). This volume starts with ?ve invited papers covering the invited lectures and tutorials of the conference. The remaining 29 papers were selected by the P- gramme Committee out of 101 submissions after a very intensive reviewing and discussion phase. We would like to thank the members of the Programme C- mittee and the external reviewers for their excellent and hard work. The conference programme contained three invited lectures and two invited tutorials. The invited talks were given by Edward A.

---

Table of contents :
Front Matter….Pages –
Modeling Timed Concurrent Systems….Pages 1-15
Some Remarks on Definability of Process Graphs….Pages 16-36
Sanity Checks in Formal Verification….Pages 37-51
Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi….Pages 52-63
Probability and Nondeterminism in Operational Models of Concurrency….Pages 64-78
A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems….Pages 79-94
Proving Liveness by Backwards Reachability….Pages 95-109
Model Checking Quantified Computation Tree Logic….Pages 110-125
Liveness, Fairness and Impossible Futures….Pages 126-141
Checking a Mutex Algorithm in a Process Algebra with Fairness….Pages 142-157
A Complete Axiomatic Semantics for the CSP Stable-Failures Model….Pages 158-172
Transition Systems of Elementary Net Systems with Localities….Pages 173-187
Operational Determinism and Fast Algorithms….Pages 188-202
Minimization, Learning, and Conformance Testing of Boolean Programs….Pages 203-217
A Capability Calculus for Concurrency and Determinism….Pages 218-232
A New Type System for Deadlock-Free Processes….Pages 233-247
Sortings for Reactive Systems….Pages 248-262
Dynamic Access Control in a Concurrent Object Calculus….Pages 263-278
Concurrent Rewriting for Graphs with Equivalences….Pages 279-294
Event Structure Semantics for Nominal Calculi….Pages 295-309
Encoding ℂDuce in the ℂ π -Calculus….Pages 310-326
A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification….Pages 327-342
Probabilistic I/O Automata: Theories of Two Equivalences….Pages 343-357
Reachability in Recursive Markov Decision Processes….Pages 358-374
Strategy Improvement for Stochastic Rabin and Streett Games….Pages 375-389
Weak Bisimulation Up to Elaboration….Pages 390-405
Generic Forward and Backward Simulations….Pages 406-420
On Finite Alphabets and Infinite Bases III: Simulation….Pages 421-434
Inference of Event-Recording Automata Using Timed Decision Trees….Pages 435-449
Controller Synthesis for MTL Specifications….Pages 450-464
On Interleaving in Timed Automata….Pages 465-476
A Language for Task Orchestration and Its Semantic Properties….Pages 477-491
Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words….Pages 492-508
Second-Order Simple Grammars….Pages 509-523
Back Matter….Pages –