CONCUR 2011 -- Concurrency Theory: 22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011, Proceedings (Lecture Notes in Computer Science (6901))

This book constitutes the refereed proceedings of the 22nd International Conference on Concurrency Theory, CONCUR 2011, held in Aachen, Germany, September 5-10, 2011. The 32 revised full papers were carefully reviewed and selected from 94 submissions. The papers are organized in topics such as real-time systems, probabilistic systems, automata, separation logic, π-calculus, Petri nets, process algebra and modeling, verification, games, and bisimulation. Front Matter....Pages - Carrying Probabilities to the Infinite World....Pages 1-16 Generalized Universality....Pages 17-27 Causal Nets: A Modeling Language Tailored towards Process Discovery....Pages 28-42 On Causal Semantics of Petri Nets....Pages 43-59 On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing....Pages 60-75 Timed Automata Can Always Be Made Implementable....Pages 76-91 Coarse Abstractions Make Zeno Behaviours Difficult to Detect....Pages 92-107 Bisimulations Meet PCTL Equivalences for Probabilistic Automata....Pages 108-123 A Spectrum of Behavioral Relations over LTSs on Probability Distributions....Pages 124-139 Fixed-Delay Events in Generalized Semi-Markov Processes Revisited....Pages 140-155 Semantic Analysis of Gossip Protocols for Wireless Sensor Networks....Pages 156-170 An Automaton over Data Words That Captures EMSO Logic....Pages 171-186 Advanced Ramsey-Based Büchi Automata Inclusion Testing....Pages 187-202 Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations....Pages 203-218 Granularity and Concurrent Separation Logic....Pages 219-234 Tractable Reasoning in a Fragment of Separation Logic....Pages 235-249 On Locality and the Exchange Law for Concurrent Processes....Pages 250-264 Typed ψ -calculi....Pages 265-279 Full Abstraction in a Subtyped pi-Calculus with Linear Types....Pages 280-296 Controlling Reversibility in Higher-Order Pi....Pages 297-311 A Connector Algebra for P/T Nets Interactions....Pages 312-326 Vector Addition System Reversible Reachability Problem....Pages 327-341 Efficient Contextual Unfolding....Pages 342-357 Parameterized Complexity Results for 1-safe Petri Nets....Pages 358-372 The Decidability of the Reachability Problem for CCS ! ....Pages 373-388 Static Livelock Analysis in CSP....Pages 389-403 Dynamic Reactive Modules....Pages 404-418 Weak Kripke Structures and LTL....Pages 419-433 Efficient CTL Model-Checking for Pushdown Systems....Pages 434-449 Reasoning about Threads with Bounded Lock Chains....Pages 450-465 A Temporal Logic for the Interaction of Strategies....Pages 466-481 The Complexity of Nash Equilibria in Limit-Average Games....Pages 482-496 Two Variable vs. Linear Temporal Logic in Model Checking and Games....Pages 497-511 A Compositional Framework for Controller Synthesis....Pages 512-527 Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes....Pages 528-542 Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems....Pages 543-558 Back Matter....Pages - Annotation This book constitutes the refereed proceedings of the 22nd International Conference on Concurrency Theory, CONCUR 2011, held in Aachen, Germany, September 5-10, 2011. The 32 revised full papers were carefully reviewed and selected from 94 submissions. The papers are organized in topics such as real-time systems, probabilistic systems, automata, separation logic, -calculus, Petri nets, process algebra and modeling, verification, games, and bisimulation