CONCUR 2001 — Concurrency Theory: 12th International Conference Aalborg, Denmark, August 20–25, 2001 Proceedings

Parosh Aziz Abdulla, Bengt Jonsson (auth.), Kim G. Larsen, Mogens Nielsen (eds.)3540424970, 9783540424970

This book constitutes the refereed proceedings of the 12th International Conference on Concurrency Theory, CONCUR 2001, held in Aalborg, Denmark in August 2001.
The 32 revised full papers presented together with six invited contributions were carefully reviewed and selected from 78 submissions. The papers are organized in topical sections on mobility, probabilistic systems, model checking, process algebra, unfoldings and prefixes, logic and compositionality, and games.

---

Table of contents :
Channel Representations in Protocol Verification….Pages 1-15
Bigraphical Reactive Systems….Pages 16-35
Control of Networks of Unmanned Vehicles….Pages 36-36
Process Algebra and Security (Abstract)….Pages 37-38
Using the Bandera Tool Set to Model-Check Properties of Concurrent Java Software….Pages 39-58
Performance Evaluation:= (Process Algebra + Model Checking) X Markov Chains….Pages 59-81
Typing Mobility in the Seal Calculus….Pages 82-101
Reasoning about Security in Mobile Ambients….Pages 102-120
Synchronized Hyperedge Replacement with Name Mobility….Pages 121-136
Dynamic Input/Output Automata: A Formal Model for Dynamic Systems….Pages 137-151
Probabilistic Information Flow in a Process Algebra….Pages 152-168
Symbolic Computation of Maximal Probabilisti Reachability….Pages 169-183
Randomized Non-sequential Processes….Pages 184-201
Liveness and Fairness in Process-Algebraic Verification….Pages 202-217
Bounded Reachability Checking with Process Semantics….Pages 218-232
Techniques for Smaller Intermediary BDDs….Pages 233-247
An Algebraic Characterization of Data and Timed Languages….Pages 248-261
A Faster-than Relation for Asynchronous Processes….Pages 262-276
On the Power of Labels in Transition Systems….Pages 277-291
On Barbed Equivalences in π-Calculus….Pages 292-304
CCS with Priority Guards….Pages 305-320
A Testing Theory for Generally Distributed Stochastic Processes….Pages 321-335
An Algorithm for Quantitative Verification of Probabilistic Transition Systems….Pages 336-350
Compositional Methods for Probabilistic Systems….Pages 351-365
Towards an Efficient Algorithm for Unfolding Petri Nets….Pages 366-380
A Static Analysis Technique for Graph Transformation Systems….Pages 381-395
Local First Search — A New Paradigm for Partial Order Reductions….Pages 396-410
Extending Memory Consistency of Finite Prefixes to Infinite Computations….Pages 411-425
Abstraction-Based Model Checking Using Modal Transition Systems….Pages 426-440
Efficient Multiple-Valued Model-Checking Using Lattice Representations….Pages 441-455
Divide and Compose: SCC Refinement for Language Emptiness….Pages 456-471
Unavoidable Configurations of Parameterized Rings of Processes….Pages 472-486
Logic of Global Synchrony….Pages 487-501
Compositional Modeling of Reactive Systems Using Open Nets….Pages 502-518
Extended Temporal Logic Revisited….Pages 519-535
Symbolic Algorithms for Infinite-State Games….Pages 536-550
A Game-Based Verification of Non-repudiation and Fair Exchange Protocols….Pages 551-565
The Control of Synchronous Systems, Part II….Pages 566-581