+612 9045 4394
$7.95 Delivery per order to Australia and New Zealand
100% Australian owned
Over a hundred thousand in-stock titles ready to ship
Concur'99. Concurrency Theory : 10th International Conference Eindhoven, the Netherlands, August 24-27, 1999 Proceedings - Jos C.M. Baeten

Concur'99. Concurrency Theory

10th International Conference Eindhoven, the Netherlands, August 24-27, 1999 Proceedings

By: Jos C.M. Baeten (Editor), Sjouke Mauw (Editor)

Paperback Published: 13th August 1999
ISBN: 9783540664253
Number Of Pages: 584

Share This Book:


or 4 easy payments of $45.32 with Learn more
Ships in 10 to 15 business days

Earn 363 Qantas Points
on this Book

This volume contains the proceedings of the 10th International Conference on Concurrency Theory (CONCUR'99) held in Eindhoven, The Netherlands, 24-27 August 1999. ThepurposeoftheCONCURconferencesistobringtogetherresearchers, - velopersandstudentsinordertoadvancethetheoryofconcurrencyandpromote its applications. Interest in this topic is continuously growing, as a consequence oftheimportanceandubiquityofconcurrentsystemsandtheirapplications, and of the scienti?c relevance of their foundations. The scope of CONCUR'99 covers all areas of semantics, logics and veri?cation techniques for concurrent systems. A list of speci?c topics includes (but is not limited to) concurrency-related - pects of: models of computation and semantic domains, process algebras, Petri nets, event structures, real-time systems, hybrid systems, stochastic systems, - cidability, model-checking, veri?cation techniques, re?nement techniques, term and graph rewriting, distributed programming, logic constraint programming, object-oriented programming, typing systems and algorithms, case studies, and tools and environments for programming and veri?cation. The ?rst two CONCUR conferences were held in Amsterdam (NL) in 1990 and 1991, the following ones in Stony Brook (USA), Hildesheim (D), Uppsala (S), Philadelphia (USA), Pisa (I), Warsaw (PL) and Nice (F). The proceedings have appeared in Springer LNCS, as Volumes 458, 527, 630, 715, 836, 962, 1119, 1243, and 1466.

Temporal Process Logicp. 1
An Unfolding Algorithm for Synchronous Products of Transition Systemsp. 2
Petri Nets, Configuration Structures and Higher Dimensional Automatap. 21
Expressiveness and Distributed Implementation of Concurrent Calculi with Link Mobilityp. 28
Techniques for Decidability and Undecidability of Bisimilarityp. 30
Testing Concurrent Systems: A Formal Approachp. 46
Computing Minimum and Maximum Reachability Times in Probabilistic Systemsp. 66
Automating Modular Verificationp. 82
"Next" Heuristic for On-the-Fly Model Checkingp. 98
Model Checking of Message Sequence Chartsp. 114
Synthesis of Large Concurrent Programs via Pairwise Compositionp. 130
Approximative Symbolic Model Checking of Continuous-Time Markov Chainsp. 146
From Synchrony to Asynchronyp. 162
Reachability Analysis of (Timed) Petri Nets Using Real Arithmeticp. 178
Weak and Strong Composition of High-Level Petri Netsp. 194
Model Checking of Time Petri Nets Based on Partial Order Semanticsp. 210
Generic Process Algebras for Asynchronous Communicationp. 226
Timed Automata and the Theory of Real Numbersp. 242
Metrics for Labeled Markov Systemsp. 258
The Expressive Power of Temporal Logic of Actionsp. 274
Object Types against Racesp. 288
Open Bisimulations on Chi Processesp. 304
Rectangular Hybrid Gamesp. 320
Localizability of Fairness Constraints and Their Distributed Implementationsp. 336
Generating Type Systems for Process Graphsp. 352
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Timep. 368
Robust Satisfactionp. 383
Statecharts via Process Algebrap. 399
A Partial Order Event Model for Concurrent Objectsp. 415
Partial Order Reduction for Model Checking of Timed Automatap. 431
On the Semantics of Place/Transition Netsp. 447
Validating Firewalls in Mobile Ambientsp. 463
On Coherence Properties in Term Rewriting Models of Concurrencyp. 478
Synchronous Structuresp. 494
Weakest-Congruence Results for Livelock-Preserving Equivalencesp. 510
Proof-Checking Protocols Using Bisimulationsp. 525
Event Structures as Presheaves - Two Representation Theoremsp. 541
Subtyping and Locality in Distributed Higher Order Processesp. 557
Author Indexp. 573
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540664253
ISBN-10: 3540664254
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 584
Published: 13th August 1999
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 3.07
Weight (kg): 0.82

Earn 363 Qantas Points
on this Book