Concur 2002-Concurrency Theory : 13th International Conference, Brno, Czech Republic, August, 2002: Proceedings Book

	Refinement and Verification Applied to an In-Flight Data Acquisition Unit	1
	A Deductive Proof System for CTL	24
	Event-State Duality: The Enriched Case	41
	Expressive Power of Temporal Logics	57
	Types, or: Where's the Difference Between CCS and [pi]?	76
	Introduction to Modal and Temporal Mu-Calculi	98
	Types for Cryptographic Protocols	99
	Network Invariants in Action	101
	Regular Model Checking Made Simple and Efficient	116
	A Hierarchy of Polynomial-Time Computable Simulations for Automata	131
	A Decidable Class of Asynchronous Distributed Controllers	145
	Alphabet-Based Synchronisation is Exponentially Cheaper	161
	Safe Realizability of High-Level Message Sequence Charts	177
	Widening the Boundary between Decidable and Undecidable Hybrid Systems	193
	A Spatial Logic for Concurrency (Part II)	209
	Reducing Model Checking from Multi-valued CTL to CTL	226
	Local Model Checking Games for Fixed Point Logic with Chop	240
	A Decidable Fixpoint Logic for Time-Outs	255
	A Calculus of Mobile Resources	272
	Using Ambients to Control Resources	288
	Typing and Subtyping Mobility in Boxed Ambients	304
	Orchestrating Transactions in Join Calculus	321
	Simulation for Continuous-Time Markov Chains	338
	Weak Bisimulation is Sound and Complete for PCTL	355
	Decision Algorithms for Probabilistic Bisimulation	371
	Axiomatizing an Algebra of Step Reactions for Synchronous Languages	386
	Regular Sets of Pomsets with Autoconcurrency	402
	The Fusion Machine	418
	HOPLA - A Higher-Order Process Language	434
	A First Order Coalgebraic Model of [pi]-Calculus Early Observational Equivalence	449
	Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes	466
	A Framework for the Analysis of Security Protocols	483
	On Name Generation and Set-Based Analysis in the Dolev-Yao Model	499
	On the Decidability of Cryptographic Protocols with Open-Ended Data Structures	515
	Causality Semantics of Petri Nets with Weighted Inhibitor Arcs	531
	Refinement-Robust Fairness	547
	Decidability of Strong Bisimilarity for Timed BPP	562
	Undecidability of Weak Bisimilarity for Pushdown Processes	579
	Why Is Simulation Harder than Bisimulation?	594
	Author Index	611