CONCUR 2002 — Concurrency Theory: 13th International Conference Brno, Czech Republic, August 20–23, 2002 Proceedings

Wan Fokkink, Natalia Ioustinova, Ernst Kesseler, Jaco van de Pol, Yaroslav S. Usenko (auth.), Luboš Brim, Mojmír Křetínský, Antonín Kučera, Petr Jančar (eds.)3540440437, 9783540440437

This book constitutes the refereed proceedings of the 13th International Conference on Concurrency Theory, CONCUR 2002, held in Brno, Czech Republic in August 2002.
The 32 revised full papers presented together with abstracts of seven invited contributions were carefully reviewed and selected from 101 submissions. The papers are organized in topical sections on verification and model checking, logic, mobility, probabilistic systems, models of computation and process algebra, security, Petri nets, and bisimulation.

---

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