CONCUR 2006 - Concurrency Theory: 17th International Conference, Concur 2006, Bonn, Germany, August 27-30, 2006 : Proceedings

by Baier, Christel; Hermanns, Holger

• ISBN13: 9783540373766
• ISBN10: 3540373764
• Format: Paperback
• Copyright: 2006-09-15
• Publisher: Springer Verlag

Summary

This book constitutes the refereed proceedings of the 17th International Conference on Concurrency Theory, CONCUR 2006, held in Bonn, Germany in August 2006.The 29 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 101 submissions. The papers are organized in topical sections on model checking, process calculi, minimization and equivalence checking, types, semantics, probability, bisimulation and simulation, real time, and formal languages.

Table of Contents

Invited Contributions
Modeling Timed Concurrent Systems	p. 1
Some Remarks on Definability of Process Graphs	p. 16
Sanity Checks in Formal Verification	p. 37
Invited Tutorials
Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi	p. 52
Probability and Nondeterminism in Operational Models of Concurrency	p. 64
Model Checking
A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems	p. 79
Proving Liveness by Backwards Reachability	p. 95
Model Checking Quantified Computation Tree Logic	p. 110
Process Calculi
Liveness, Fairness and Impossible Futures	p. 126
Checking a Mutex Algorithm in a Process Algebra with Fairness	p. 142
A Complete Axiomatic Semantics for the CSP Stable-Failures Model	p. 158
Transition Systems of Elementary Net Systems with Localities	p. 173
Minimization and Equivalence Checking
Operational Determinism and Fast Algorithms	p. 188
Minimization, Learning, and Conformance Testing of Boolean Programs	p. 203
A Capability Calculus for Concurrency and Determinism	p. 218
Types
A New Type System for Deadlock-Free Processes	p. 233
Sortings for Reactive Systems	p. 248
Dynamic Access Control in a Concurrent Object Calculus	p. 263
Semantics
Concurrent Rewriting for Graphs with Equivalences	p. 279
Event Structure Semantics for Nominal Calculi	p. 295
Encoding CDuce in the C[pi]-Calculus	p. 310
Probability
A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification	p. 327
Probabilistic I/O Automata: Theories of Two Equivalences	p. 343
Reachability in Recursive Markov Decision Processes	p. 358
Strategy Improvement for Stochastic Rabin and Streett Games	p. 375
Bisimulation and Simulation
Weak Bisimulation Up to Elaboration	p. 390
Generic Forward and Backward Simulations	p. 406
On Finite Alphabets and Infinite Bases III: Simulation	p. 421
Real Time
Inference of Event-Recording Automata Using Timed Decision Trees	p. 435
Controller Synthesis for MTL Specifications	p. 450
On Interleaving in Timed Automata	p. 465
Formal Languages
A Language for Task Orchestration and Its Semantic Properties	p. 477
Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words	p. 492
Second-Order Simple Grammars	p. 509
Author Index	p. 525
Table of Contents provided by Ingram. All Rights Reserved.