CONCUR 2003 – Concurrency Theory: 14th International Conference, Marseille, France, September 3-5, 2003. Proceedings

Albert Benveniste, Stefan Haar, Eric Fabre, Claude Jard (auth.), Roberto Amadio, Denis Lugiez (eds.)3540407537, 9783540407539

This book constitutes the refereed proceedings of the 14th International Conference on Concurrency Theory, CONCUR 2003, held in Marseille, France in September 2003.

The 29 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 107 submissions. The papers are organized in topical sections on partial orders and asynchronous systems, process algebras, games, infinite systems, probabilistic automata, model checking, model checking and HMSC, security, mobility, compositional methods and real time, and probabilistic models.

---

Table of contents :
Front Matter….Pages –
Distributed Monitoring of Concurrent and Asynchronous Systems….Pages 1-26
Synthesis of Distributed Algorithms Using Asynchronous Automata….Pages 27-41
Compression of Partially Ordered Strings….Pages 42-56
Bundle Event Structures and CCSP….Pages 57-71
Syntactic Formats for Free….Pages 72-86
Priority Rewrite Systems for OSOS Process Languages….Pages 87-102
Quantitative Verification and Control via the Mu-Calculus….Pages 103-127
Playing Games with Boxes and Diamonds….Pages 128-143
The Element of Surprise in Timed Games….Pages 144-158
Deciding Bisimilarity between BPA and BPP Processes….Pages 159-173
Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management….Pages 174-190
Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic,…….Pages 191-192
A Process-Algebraic Language for Probabilistic I/O Automata….Pages 193-207
Compositionality for Probabilistic Automata….Pages 208-221
Satisfiability and Model Checking for MSO-Definable Temporal Logics Are in PSPACE….Pages 222-236
Equivalence Checking of Non-flat Systems Is EXPTIME-Hard….Pages 237-250
Model Checking a Path….Pages 251-265
Multi-valued Model Checking via Classical Model Checking….Pages 266-280
An Extension of Pushdown System and Its Model Checking Method….Pages 281-295
Netcharts: Bridging the Gap between HMSCs and Executable Specifications….Pages 296-310
High-Level Message Sequence Charts and Projections….Pages 311-326
Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus….Pages 327-349
Unifying Simulatability Definitions in Cryptographic Systems under Different Timing Assumptions….Pages 350-365
Contract Signing, Optimism, and Advantage….Pages 366-382
Full Abstraction for HOPLA….Pages 383-398
Modeling Consensus in a Process Calculus….Pages 399-414
Linear Forwarders….Pages 415-430
Abstract Patterns of Compositional Reasoning….Pages 431-445
Relating Fairness and Timing in Process Algebras….Pages 446-460
A Compositional Semantic Theory for Synchronous Component-Based Design….Pages 461-476
Conditional Expectation and the Approximation of Labelled Markov Processes….Pages 477-491
Comparative Branching-Time Semantics for Markov Chains….Pages 492-507
Quantitative Relations and Approximate Process Equivalences….Pages 508-522
Back Matter….Pages –