CONCUR 2002-concurrency theory(CONCUR 2002－并行理论/会议录)

The LNCS series reports state-of-the-art results in computer science research，development，and education，at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community，with numerous individuals，as well as with prestigious organizations and societies，LNCS has grown into the most comprehensive computer science research forum available.
The scope of LNCS，including its subseries LNAI，spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes.
—proceedings （published in time for the respective conference）
—post-proceedings （consisting of thoroughly revised final full papers）
—research monographs（which may be based on outstanding PhD work，research projects，technical reports，etc.）.

Invited Talks
　Refinement and Verification Applied to an In-Flight Data Acquisition Unit
　A Deductive Proof System for CTL
　Event-State Duality: The Enriched Case
　Expressive Power of Temporal Logics
　Types, or: Where's the Difference Between CCS and п?
Invited Tutorials
　Introduction to Modal and Temporal Mu-Calculi (Abstract)
　Types for Cryptographic Protocols
Verification, Model Checking
　Network Invariants in Action
　Regular Model Checking Made Simple and Efficient .
　A Hierarchy of Polynomial-Time Computable Simulations for Automata
　A Decidable Class of Asynchronous Distributed Controllers
　Alphabet-Based Synchronisation is Exponentially Cheaper
Safe Realizability of High-Level Message Sequence Charts
Widening the Boundary between Decidable and Undecidable Hybrid Systems
Logic
A Spatial Logic for Concurrency (Part II)
Reducing Model Checking from Multi-valued CTL* to CTL* .
Local Model Checking Games for Fixed Point Logic with Chop
A Decidable Fixpoint Logic for Time-Outs
Mobility
A Calculus of Mobile Resources
Using Ambients to Control Resources
Typing and Subtyping Mobility in Boxed Ambients
Orchestrating Transactions in Join Calculus
Probabilistic Systems
Simulation for Continuous-Time Markov Chains
Weak Bisimulation is Sound and Complete for PCTL*
Decision Algorithms for Probabilistic Bisimulation
Models of Computation ,Process Algebra
Security
Petri Nets
Bisimulation
Author Index