CONCUR 2006 - Concurrency Theory

1. Front Matter

   PDF

2. Invited Contributions

   1. Modeling Timed Concurrent Systems

      • Xiaojun Liu, Eleftherios Matsikoudis, Edward A. Lee

      Pages 1-15

   2. Some Remarks on Definability of Process Graphs

      • Clemens Grabmayer, Jan Willem Klop, Bas Luttik

      Pages 16-36

   3. Sanity Checks in Formal Verification

      • Orna Kupferman

      Pages 37-51

3. Invited Tutorials

   1. Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi

      • Uwe Nestmann

      Pages 52-63

   2. Probability and Nondeterminism in Operational Models of Concurrency

      • Roberto Segala

      Pages 64-78

4. Model Checking

   1. A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems

      • Stefan Leue, Alin Ştefănescu, Wei Wei

      Pages 79-94

   2. Proving Liveness by Backwards Reachability

      • Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, Mayank Saksena

      Pages 95-109

   3. Model Checking Quantified Computation Tree Logic

      • Arend Rensink

      Pages 110-125

5. Process Calculi

   1. Liveness, Fairness and Impossible Futures

      • Rob van Glabbeek, Marc Voorhoeve

      Pages 126-141

   2. Checking a Mutex Algorithm in a Process Algebra with Fairness

      • Flavio Corradini, Maria Rita Di Berardini, Walter Vogler

      Pages 142-157

   3. A Complete Axiomatic Semantics for the CSP Stable-Failures Model

      • Yoshinao Isobe, Markus Roggenbach

      Pages 158-172

   4. Transition Systems of Elementary Net Systems with Localities

      • Maciej Koutny, Marta Pietkiewicz-Koutny

      Pages 173-187

6. Minimization and Equivalence Checking

   1. Operational Determinism and Fast Algorithms

      • Henri Hansen, Antti Valmari

      Pages 188-202

   2. Minimization, Learning, and Conformance Testing of Boolean Programs

      • Viraj Kumar, P. Madhusudan, Mahesh Viswanathan

      Pages 203-217

   3. A Capability Calculus for Concurrency and Determinism

      • Tachio Terauchi, Alex Aiken

      Pages 218-232

7. Types

   1. A New Type System for Deadlock-Free Processes

      • Naoki Kobayashi

      Pages 233-247

   2. Sortings for Reactive Systems

      • Lars Birkedal, Søren Debois, Thomas Hildebrandt

      Pages 248-262

   3. Dynamic Access Control in a Concurrent Object Calculus

      • Avik Chaudhuri

      Pages 263-278

8. Semantics

   1. Concurrent Rewriting for Graphs with Equivalences

      • Paolo Baldan, Fabio Gadducci, Ugo Montanari

      Pages 279-294

This volume contains the proceedings of the 17th International Conference on Concurrency Theory (CONCUR) held in Bonn, Germany, August 27–30, 2006. The purpose of the CONCUR conference series is to bring together researchers, developers and students in order to advance the theory of concurrency and promote its applications. Interest in this topic is continuously growing, as a consequence of the importance and ubiquity of concurrent systems and their applications and the scientific relevance of their foundations. The scope of CONCUR covers all areas of semantics, logics, and verification 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 protocols, security protocols), related verification techniques and tools (such as staff space exploration, model-checking, synthesis, abstraction, automated deduction, testing), and related programming models (such as distributed, constraint- or object-oriented, graph rewriting, as well as associated typesystems, static analyses, abstract machines, and environments). This volume starts with five invited papers covering the invited lectures and tutorials of the conference. The remaining 29 papers were selected by the Programme Committee out of 101 submissions after a very intensive reviewing and discussion phase. We would like to thank the members of the Programme Committee and the external reviewers for their excellent and hard work. The conference programme contained three invited lectures and two invited tutorials. 

• Bisimulation
• Computation Tree Logic
• algorithm
• automata
• concurrency
• concurrent processing
• concurrent rewriting
• concurrent systems
• distributed computing
• formal language
• formal verification
• logic
• minimization
• modeling
• petri ne

• Institute for Theoretical Computer Science, Technical University Dresden, Germany

  Christel Baier

• INRIA, VASY, Grenoble Rhône-Alpes, France

  Holger Hermanns

Policies and ethics