CONCUR’99. Concurrency Theory

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.

Includes supplementary material: sn.pub/extras

Invited Lectures.- Temporal Process Logic.- An Unfolding Algorithm for Synchronous Products of Transition Systems.- Petri Nets, Configuration Structures and Higher Dimensional Automata.- Expressiveness and Distributed Implementation of Concurrent Calculi with Link Mobility.- Tutorials.- Techniques for Decidability and Undecidability of Bisimilarity.- Testing Concurrent Systems: A Formal Approach.- Accepted Papers.- Computing Minimum and Maximum Reachability Times in Probabilistic Systems.- Automating Modular Verification.- "Next" Heuristic for On-the-Fly Model Checking.- Model Checking of Message Sequence Charts.- Synthesis of Large Concurrent Programs via Pairwise Composition.- Approximative Symbolic Model Checking of Continuous-Time Markov Chains.- From Synchrony to Asynchrony.- Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic.- Weak and Strong Composition of High-Level Petri Nets.- Model Checking of Time Petri Nets Based on Partial Order Semantics.- Generic Process Algebras for Asynchronous Communication.- Timed Automata and the Theory of Real Numbers.- Metrics for Labeled Markov Systems.- The Expressive Power of Temporal Logic of Actions.- Object Types against Races.- Open Bisimulations on Chi Processes.- Rectangular Hybrid Games.- Localizability of Fairness Constraints and their Distributed Implementations.- Generating Type Systems for Process Graphs.- Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time.- Robust Satisfaction.- Statecharts via Process Algebra.- A Partial Order Event Model for Concurrent Objects.- Partial Order Reduction for Model Checking of Timed Automata.- On the Semantics of Place/Transition Nets.- Validating Firewalls in Mobile Ambients.- On Coherence Properties in Term Rewriting Models ofConcurrency.- Synchronous Structures.- Weakest-Congruence Results for Livelock-Preserving Equivalences.- Proof-Checking Protocols Using Bisimulations.- Event Structures as Presheaves-Two Representation Theorems.- Subtyping and Locality in Distributed Higher Order Processes.