Skip to main content
  • Conference proceedings
  • © 2001

CONCUR 2001 - Concurrency Theory

12th International Conference, Aalborg, Denmark, August 20-25, 2001 Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2154)

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (38 papers)

  1. Front Matter

    Pages I-XI
  2. Invited Talks

    1. Channel Representations in Protocol Verification

      • Parosh Aziz Abdulla, Bengt Jonsson
      Pages 1-15
    2. Bigraphical Reactive Systems

      • Robin Milner
      Pages 16-35
    3. Control of Networks of Unmanned Vehicles

      • Shankar Sastry
      Pages 36-36
    4. Process Algebra and Security (Abstract)

      • Steve Schneider
      Pages 37-38
  3. Invited Tutorials

    1. Performance Evaluation:= (Process Algebra + Model Checking) X Markov Chains

      • Holger Hermanns, Joost-Pieter Katoen
      Pages 59-81
  4. Mobility

    1. Typing Mobility in the Seal Calculus

      • Giuseppe Castagna, Giorgio Ghelli, Francesco Zappa Nardelli
      Pages 82-101
    2. Reasoning about Security in Mobile Ambients

      • Michele Bugliesi, Giuseppe Castagna, Silvia Crafa
      Pages 102-120
    3. Synchronized Hyperedge Replacement with Name Mobility

      • Dan Hirsch, Ugo Montanari
      Pages 121-136
    4. Dynamic Input/Output Automata: A Formal Model for Dynamic Systems

      • Paul C. Attie, Nancy A. Lynch
      Pages 137-151
  5. Probabilistic Systems

    1. Probabilistic Information Flow in a Process Algebra

      • Alessandro Aldini
      Pages 152-168
    2. Symbolic Computation of Maximal Probabilisti Reachability

      • Marta Kwiatkowska, Gethin Norman, Jeremy Sproston
      Pages 169-183
    3. Randomized Non-sequential Processes

      • Hagen Völzer
      Pages 184-201
  6. Model Checking

    1. Liveness and Fairness in Process-Algebraic Verification

      • Antti Puhakka, Antti Valmari
      Pages 202-217
    2. Techniques for Smaller Intermediary BDDs

      • Jaco Geldenhuys, Antti Valmari
      Pages 233-247
    3. An Algebraic Characterization of Data and Timed Languages

      • Patricia Bouyer, Antoine Petit, Denis Thérien
      Pages 248-261
  7. Process Algebra

    1. A Faster-than Relation for Asynchronous Processes

      • Gerald Lüttgen, Walter Vogler
      Pages 262-276
    2. On the Power of Labels in Transition Systems

      • Jiří Srba
      Pages 277-291

About this book

This book constitutes the refereed proceedings of the 12th International Conference on Concurrency Theory, CONCUR 2001, held in Aalborg, Denmark in August 2001.
The 32 revised full papers presented together with six invited contributions were carefully reviewed and selected from 78 submissions. The papers are organized in topical sections on mobility, probabilistic systems, model checking, process algebra, unfoldings and prefixes, logic and compositionality, and games.

Editors and Affiliations

  • Department of Computer Science, BRICS, Aalborg University, Aalborg, Denmark

    Kim G. Larsen

  • BRICS, Aarhus University, Aarhus C, Denmark

    Mogens Nielsen

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access