Skip to main content
  • Conference proceedings
  • © 2003

CONCUR 2003 - Concurrency Theory

14th International Conference, Marseille, France, September 3-5, 2003, Proceedings

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

Conference series link(s): CONCUR: International Conference on Concurrency Theory

Conference proceedings info: CONCUR 2003.

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (33 papers)

  1. Front Matter

  2. Partial Orders and Asynchronous Systems

    1. Distributed Monitoring of Concurrent and Asynchronous Systems

      • Albert Benveniste, Stefan Haar, Eric Fabre, Claude Jard
      Pages 1-26
    2. Synthesis of Distributed Algorithms Using Asynchronous Automata

      • Alin Ştefănescu, Javier Esparza, Anca Muscholl
      Pages 27-41
    3. Compression of Partially Ordered Strings

      • Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, Sudipto Guha, Mihalis Yannakakis
      Pages 42-56
  3. Process Algebra

    1. Bundle Event Structures and CCSP

      • Rob van Glabbeek, Frits Vaandrager
      Pages 57-71
    2. Syntactic Formats for Free

      • Bartek Klin, Paweł Sobociński
      Pages 72-86
  4. Games

    1. Playing Games with Boxes and Diamonds

      • Rajeev Alur, Salvatore La Torre, P. Madhusudan
      Pages 128-143
    2. The Element of Surprise in Timed Games

      • Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar, Mariëlle Stoelinga
      Pages 144-158
  5. Infinite Systems

    1. Deciding Bisimilarity between BPA and BPP Processes

      • Petr Jančar, Antonín Kučera, Faron Moller
      Pages 159-173
    2. Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management

      • Ahmed Bouajjani, Peter Habermehl, Tomáš Vojnar
      Pages 174-190
  6. Probabilistic Automata

    1. A Process-Algebraic Language for Probabilistic I/O Automata

      • Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
      Pages 193-207
    2. Compositionality for Probabilistic Automata

      • Nancy Lynch, Roberto Segala, Frits Vaandrager
      Pages 208-221
  7. Model-Checking

    1. Model Checking a Path

      • N. Markey, P. Schnoebelen
      Pages 251-265
  8. Model-Checking and HMSC

    1. Multi-valued Model Checking via Classical Model Checking

      • Arie Gurfinkel, Marsha Chechik
      Pages 266-280
    2. An Extension of Pushdown System and Its Model Checking Method

      • Naoya Nitta, Hiroyuki Seki
      Pages 281-295

Other Volumes

  1. CONCUR 2003 - Concurrency Theory

Keywords

  • Bridging
  • Erfüllbarkeitsproblem der Aussagenlogik
  • Extreme Programming
  • Monitor
  • algorithm
  • concurrency
  • coordination
  • distributed computing
  • formal verification
  • hybrid systems
  • infinite state systems
  • modeling
  • petri nets
  • process algebra
  • verification

Editors and Affiliations

  • Université Paris 7, PPS, Case 7014, Paris Cedex 13, France

    Roberto Amadio

  • LIF, CNRS, Aix-Marseille Université, France

    Denis Lugiez

Bibliographic Information

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions