CONCUR 2012- Concurrency Theory

1. Mobility and Space in Process Algebras

   1. Nested Protocols in Session Types

      • Romain Demangeon, Kohei Honda

      Pages 272-286

   2. Intensional and Extensional Characterisation of Global Progress in the π-Calculus

      • Luca Fossati, Kohei Honda, Nobuko Yoshida

      Pages 287-301

   3. Duality and i/o-Types in the π-Calculus

      • Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi

      Pages 302-316

   4. Spatial and Epistemic Modalities in Constraint-Based Process Calculi

      • Sophia Knight, Catuscia Palamidessi, Prakash Panangaden, Frank D. Valencia

      Pages 317-332

2. Stochastic Systems

   1. Fluid Model Checking

      • Luca Bortolussi, Jane Hillston

      Pages 333-347

   2. Playing Stochastic Games Precisely

      • Taolue Chen, Vojtěch Forejt, Marta Kwiatkowska, Aistis Simaitis, Ashutosh Trivedi, Michael Ummels

      Pages 348-363

   3. Efficient Modelling and Generation of Markov Automata

      • Mark Timmer, Joost-Pieter Katoen, Jaco van de Pol, Mariëlle I. A. Stoelinga

      Pages 364-379

   4. Exact Fluid Lumpability for Markovian Process Algebra

      • Max Tschaikowski, Mirco Tribastone

      Pages 380-394

3. Probabilistic Systems

   1. Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics

      • Daniel Gebler, Wan Fokkink

      Pages 395-409

   2. Coalgebraic Trace Semantics for Probabilistic Transition Systems Based on Measure Theory

      • Henning Kerstan, Barbara König

      Pages 410-424

4. Petri Nets and Non-sequential Semantics

   1. Modeling Interval Order Structures with Partially Commutative Monoids

      • Ryszard Janicki, Xiang Yin, Nadezhda Zubkova

      Pages 425-439

   2. A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets

      • Roland Meyer, Victor Khomenko, Reiner Hüchting

      Pages 440-455

   3. Algebraic Structure of Combined Traces

      • Łukasz Mikulski

      Pages 456-470

   4. Verification of Petri Nets with Read Arcs

      • César Rodríguez, Stefan Schwoon

      Pages 471-485

5. Verification

   1. Efficient Checking of Link-Reversal-Based Concurrent Systems

      • Matthias Függer, Josef Widder

      Pages 486-499

   2. Efficient Coverability Analysis by Proof Minimization

      • Alexander Kaiser, Daniel Kroening, Thomas Wahl

      Pages 500-515

   3. A Framework for Formally Verifying Software Transactional Memory Algorithms

      • Mohsen Lesani, Victor Luchangco, Mark Moir

      Pages 516-530

   4. Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems

      • Roy Mennicke

      Pages 531-546

6. Decidability

   1. MSO Decidability of Multi-Pushdown Systems via Split-Width

      • Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar

      Pages 547-561

   2. Decidability Problems for Actor Systems

      • Frank S. de Boer, Mahdi M. Jaghoori, Cosimo Laneve, Gianluigi Zavattaro

      Pages 562-577

This book constitutes the thoroughly refereed proceedings of the 23rd International Conference on Concurrency Theory, CONCUR 2012, held in Newcastle upon Tyne, UK, September 4-7, 2012. The 35 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 97 submissions. The papers are organized in topics such as reachability analysis; qualitative and timed systems; behavioural equivalences; temporal logics; session types; abstraction; mobility and space in process algebras; stochastic systems; probabilistic systems; Petri nets and non-sequential semantics; verification; decidability.

• concurrent software
• distributed computing
• modal logic
• model checking
• probabilistic automata

• School of Computing Science, Newcastle University, Newcastle upon Tyne, UK

  Maciej Koutny

• Department of Computer Science, University of Leicester, Leicester, UK

  Irek Ulidowski

Policies and ethics