CONCUR 2006 – Concurrency Theory

17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006. Proceedings

  • Christel Baier
  • Holger Hermanns
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4137)

Table of contents

  1. Front Matter
  2. Invited Contributions

    1. Xiaojun Liu, Eleftherios Matsikoudis, Edward A. Lee
      Pages 1-15
    2. Clemens Grabmayer, Jan Willem Klop, Bas Luttik
      Pages 16-36
    3. Orna Kupferman
      Pages 37-51
  3. Invited Tutorials

  4. Model Checking

    1. Stefan Leue, Alin Ştefănescu, Wei Wei
      Pages 79-94
    2. Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, Mayank Saksena
      Pages 95-109
  5. Process Calculi

    1. Rob van Glabbeek, Marc Voorhoeve
      Pages 126-141
    2. Flavio Corradini, Maria Rita Di Berardini, Walter Vogler
      Pages 142-157
    3. Yoshinao Isobe, Markus Roggenbach
      Pages 158-172
    4. Maciej Koutny, Marta Pietkiewicz-Koutny
      Pages 173-187
  6. Minimization and Equivalence Checking

    1. Henri Hansen, Antti Valmari
      Pages 188-202
    2. Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
      Pages 203-217
    3. Tachio Terauchi, Alex Aiken
      Pages 218-232
  7. Types

    1. Naoki Kobayashi
      Pages 233-247
    2. Lars Birkedal, Søren Debois, Thomas Hildebrandt
      Pages 248-262
  8. Semantics

    1. Paolo Baldan, Fabio Gadducci, Ugo Montanari
      Pages 279-294

About these proceedings

Introduction

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. 

Keywords

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

Editors and affiliations

  • Christel Baier
    • 1
  • Holger Hermanns
    • 2
  1. 1.Institute for Theoretical Computer ScienceTechnical University DresdenGermany
  2. 2.INRIA, VASY, Grenoble Rhône-AlpesFrance

Bibliographic information

  • DOI https://doi.org/10.1007/11817949
  • Copyright Information Springer-Verlag Berlin Heidelberg 2006
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-37376-6
  • Online ISBN 978-3-540-37377-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book