CONCUR 2003 - Concurrency Theory

This volume contains the proceedings of the 14th International Conference on ConcurrencyTheory(CONCUR2003)heldinMarseille,France,September3 5, 2003. The conference was hosted by the Universit edeProvenceandtheLa- ratoire d Informatique Fondamentale de Marseille (LIF). The purpose of the CONCUR conferences 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 of the scienti?c relevance of their fundations. The scope of the conference covers all areas of semantics, logics, and veri?cation techniques for concurrent systems. Topics include concurrency-related aspects of: models of computation and semantic domains, process algebras, Petri nets, event struc- res, real-time systems, hybrid systems, decidability, model-checking, veri?cation and re?nement techniques, term and graph rewriting, distributed programming, logic constraint programming, object-oriented programming, types systems and algorithms, case studies, and tools and environments for programming and - ri?cation. Of the 107 papers submitted this year, 29 were accepted for presentation. Four invited talks were given at the conference: on Distributed Monitoring of Concurrent and Asynchronous Systems by Albert Beneveniste, on Quantitative Veri?cation via the MU-Calculus by Luca De Alfaro, on Input-Output Au- mata: Basic, Timed, Hybrid, Probabilistic, Dynamic,. . . by Nancy Lynch, and on Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus by Andre Scedrov.

Inhalt
Partial Orders and Asynchronous Systems.- Distributed Monitoring of Concurrent and Asynchronous Systems.- Synthesis of Distributed Algorithms Using Asynchronous Automata.- Compression of Partially Ordered Strings.- Process Algebra.- Bundle Event Structures and CCSP.- Syntactic Formats for Free.- Priority Rewrite Systems for OSOS Process Languages.- Games.- Quantitative Verification and Control via the Mu-Calculus.- Playing Games with Boxes and Diamonds.- The Element of Surprise in Timed Games.- Infinite Systems.- Deciding Bisimilarity between BPA and BPP Processes.- Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management.- Probabilistic Automata.- Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic,....- A Process-Algebraic Language for Probabilistic I/O Automata.- Compositionality for Probabilistic Automata.- Model-Checking.- Satisfiability and Model Checking for MSO-Definable Temporal Logics Are in PSPACE.- Equivalence Checking of Non-flat Systems Is EXPTIME-Hard.- Model Checking a Path.- Model-Checking and HMSC.- Multi-valued Model Checking via Classical Model Checking.- An Extension of Pushdown System and Its Model Checking Method.- Netcharts: Bridging the Gap between HMSCs and Executable Specifications.- High-Level Message Sequence Charts and Projections.- Security.- Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus.- Unifying Simulatability Definitions in Cryptographic Systems under Different Timing Assumptions.- Contract Signing, Optimism, and Advantage.- Mobility.- Full Abstraction for HOPLA.- Modeling Consensus in a Process Calculus.- Linear Forwarders.- Compositional Methods and Real Time.- Abstract Patterns of Compositional Reasoning.- Relating Fairness and Timing in Process Algebras.- A Compositional Semantic Theory for Synchronous Component-Based Design.- Probabilistic Models.- Conditional Expectation and the Approximation of Labelled Markov Processes.- Comparative Branching-Time Semantics for Markov Chains.- Quantitative Relations and Approximate Process Equivalences.