CONCUR 2011 -- Concurrency Theory

1. Front Matter

   PDF

2. Invited Talks

   1. Carrying Probabilities to the Infinite World

      • Parosh Aziz Abdulla

      Pages 1-16

   2. Generalized Universality

      • Eli Gafni, Rachid Guerraoui

      Pages 17-27

   3. Causal Nets: A Modeling Language Tailored towards Process Discovery

      • Wil van der Aalst, Arya Adriansyah, Boudewijn van Dongen

      Pages 28-42

   4. On Causal Semantics of Petri Nets

      • Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke

      Pages 43-59

3. Real-Time Systems

   1. On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing

      • Paritosh K. Pandya, Simoni S. Shah

      Pages 60-75

   2. Timed Automata Can Always Be Made Implementable

      • Patricia Bouyer, Kim G. Larsen, Nicolas Markey, Ocan Sankur, Claus Thrane

      Pages 76-91

   3. Coarse Abstractions Make Zeno Behaviours Difficult to Detect

      • Frédéric Herbreteau, B. Srivathsan

      Pages 92-107

4. Probabilistic Systems

   1. Bisimulations Meet PCTL Equivalences for Probabilistic Automata

      • Lei Song, Lijun Zhang, Jens Chr. Godskesen

      Pages 108-123

   2. A Spectrum of Behavioral Relations over LTSs on Probability Distributions

      • Silvia Crafa, Francesco Ranzato

      Pages 124-139

   3. Fixed-Delay Events in Generalized Semi-Markov Processes Revisited

      • Tomáš Brázdil, Jan Krčál, Jan Křetínský, Vojtěch Řehák

      Pages 140-155

   4. Semantic Analysis of Gossip Protocols for Wireless Sensor Networks

      • Ruggero Lanotte, Massimo Merro

      Pages 156-170

5. Automata

   1. An Automaton over Data Words That Captures EMSO Logic

      • Benedikt Bollig

      Pages 171-186

   2. Advanced Ramsey-Based Büchi Automata Inclusion Testing

      • Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukáš Holík, Chih-Duo Hong, Richard Mayr et al.

      Pages 187-202

   3. Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations

      • Salvatore La Torre, Margherita Napoli

      Pages 203-218

6. Separation Logic

   1. Granularity and Concurrent Separation Logic

      • Jonathan Hayman

      Pages 219-234

   2. Tractable Reasoning in a Fragment of Separation Logic

      • Byron Cook, Christoph Haase, Joël Ouaknine, Matthew Parkinson, James Worrell

      Pages 235-249

   3. On Locality and the Exchange Law for Concurrent Processes

      • C. A. R. Hoare, Akbar Hussain, Bernhard Möller, Peter W. O’Hearn, Rasmus Lerchedahl Petersen, Georg Struth

      Pages 250-264

7. π-Calculus

   1. Typed ψ-calculi

      • Hans Hüttel

      Pages 265-279

   2. Full Abstraction in a Subtyped pi-Calculus with Linear Types

      • Romain Demangeon, Kohei Honda

      Pages 280-296

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.

• concurrent processes
• distributed computing
• model checking
• probabilistic automata
• reactive systems
• systems analysis
• temporal logics

• Software Modeling and Verification, RWTH Aachen, Aachen, Germany

  Joost-Pieter Katoen

• Fakultät für Ingenieurwesen, Abteilung für Informatik und Angewandte Kognitionswissenschaft, Universität Duisburg-Essen,, Duisburg, Germany

  Barbara König

Policies and ethics