+612 9045 4394
 
CHECKOUT
CONCUR 2003 - Concurrency Theory : 14th International Conference, Marseille, France, September 3-5, 2003, Proceedings - Roberto Amadio

CONCUR 2003 - Concurrency Theory

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

By: Roberto Amadio (Editor), Denis Lugiez (Editor)

Paperback

Published: 21st August 2003
Ships: 5 to 9 business days
5 to 9 business days
$158.39
or 4 easy payments of $39.60 with Learn more

This volume contains the proceedings of the 14th International Conference on ConcurrencyTheory(CONCUR2003)heldinMarseille, France, September3-5, 2003. The conference was hosted by the UniversitedeProvenceandtheLa- 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.

Distributed Monitoring of Concurrent and Asynchronous Systemsp. 1
Synthesis of Distributed Algorithms Using Asynchronous Automatap. 27
Compression of Partially Ordered Stringsp. 42
Bundle Event Structures and CCSPp. 57
Syntactic Formats for Freep. 72
Priority Rewrite Systems for OSOS Process Languagesp. 87
Quantitative Verification and Control via the Mu-Calculusp. 103
Playing Games with Boxes and Diamondsp. 128
The Element of Surprise in Timed Gamesp. 144
Deciding Bisimilarity between BPA and BPP Processesp. 159
Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Managementp. 174
Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamicp. 191
A Process-Algebraic Language for Probabilistic I/O Automatap. 193
Compositionality for Probabilistic Automatap. 208
Satisfiability and Model Checking for MSO-Definable Temporal Logics Are in PSPACEp. 222
Equivalence Checking of Non-flat Systems Is EXPTIME-Hardp. 237
Model Checking a Pathp. 251
Multi-valued Model Checking via Classical Model Checkingp. 266
An Extension of Pushdown System and Its Model Checking Methodp. 281
Netcharts: Bridging the Gap between HMSCs and Executable Specificationsp. 296
High-Level Message Sequence Charts and Projectionsp. 311
Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculusp. 327
Unifying Simulatability Definitions in Cryptographic Systems under Different Timing Assumptionsp. 350
Contract Signing, Optimism, and Advantagep. 366
Full Abstraction for HOPLAp. 383
Modeling Consensus in a Process Calculusp. 399
Linear Forwardersp. 415
Abstract Patterns of Compositional Reasoningp. 431
Relating Fairness and Timing in Process Algebrasp. 446
A Compositional Semantic Theory for Synchronous Component-Based Designp. 461
Conditional Expectation and the Approximation of Labelled Markov Processesp. 477
Comparative Branching-Time Semantics for Markov Chainsp. 492
Quantitative Relations and Approximate Process Equivalencesp. 508
Author Indexp. 523
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540407539
ISBN-10: 3540407537
Series: Lecture Notes in Computer Science
Audience: Professional
Format: Paperback
Language: English
Number Of Pages: 524
Published: 21st August 2003
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.5 x 15.5  x 2.79
Weight (kg): 1.66