CONCUR 2003 - Concurrency Theory

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

Editors:

ISBN: 978-3-540-40753-9 (Print) 978-3-540-45187-7 (Online)

Table of contents (33 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Partial Orders and Asynchronous Systems

    1. No Access

      Book Chapter

      Pages 1-26

      Distributed Monitoring of Concurrent and Asynchronous Systems

    2. No Access

      Book Chapter

      Pages 27-41

      Synthesis of Distributed Algorithms Using Asynchronous Automata

    3. No Access

      Book Chapter

      Pages 42-56

      Compression of Partially Ordered Strings

  3. Process Algebra

    1. No Access

      Book Chapter

      Pages 57-71

      Bundle Event Structures and CCSP

    2. No Access

      Book Chapter

      Pages 72-86

      Syntactic Formats for Free

    3. No Access

      Book Chapter

      Pages 87-102

      Priority Rewrite Systems for OSOS Process Languages

  4. Games

    1. No Access

      Book Chapter

      Pages 103-127

      Quantitative Verification and Control via the Mu-Calculus

    2. No Access

      Book Chapter

      Pages 128-143

      Playing Games with Boxes and Diamonds

    3. No Access

      Book Chapter

      Pages 144-158

      The Element of Surprise in Timed Games

  5. Infinite Systems

    1. No Access

      Book Chapter

      Pages 159-173

      Deciding Bisimilarity between BPA and BPP Processes

    2. No Access

      Book Chapter

      Pages 174-190

      Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management

  6. Probabilistic Automata

    1. No Access

      Book Chapter

      Pages 191-192

      Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic,...

    2. No Access

      Book Chapter

      Pages 193-207

      A Process-Algebraic Language for Probabilistic I/O Automata

    3. No Access

      Book Chapter

      Pages 208-221

      Compositionality for Probabilistic Automata

  7. Model-Checking

    1. No Access

      Book Chapter

      Pages 222-236

      Satisfiability and Model Checking for MSO-Definable Temporal Logics Are in PSPACE

    2. No Access

      Book Chapter

      Pages 237-250

      Equivalence Checking of Non-flat Systems Is EXPTIME-Hard

    3. No Access

      Book Chapter

      Pages 251-265

      Model Checking a Path

  8. Model-Checking and HMSC

    1. No Access

      Book Chapter

      Pages 266-280

      Multi-valued Model Checking via Classical Model Checking

    2. No Access

      Book Chapter

      Pages 281-295

      An Extension of Pushdown System and Its Model Checking Method

    3. No Access

      Book Chapter

      Pages 296-310

      Netcharts: Bridging the Gap between HMSCs and Executable Specifications

previous Page of 2