Skip to main content
SpringerLink
Log in
Book cover

CONCUR 2011 -- Concurrency Theory

22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011, Proceedings

  • Conference proceedings
  • © 2011

Overview

Editors:
  1. Joost-Pieter Katoen

    1. Software Modeling and Verification, RWTH Aachen, Aachen, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Barbara König

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Fast track conference proceedings
  • Unique visibility
  • State of the art research

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6901)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: CONCUR 2011.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (36 papers)

  1. Front Matter

    Download chapter 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
Back to top

Other volumes

  1. CONCUR 2011 – Concurrency Theory

Keywords

About this book

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.

Editors and Affiliations

  • 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

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation