CONCUR 2012- Concurrency Theory

1. Front Matter

   PDF

2. Invited Talks

   1. Turing Meets Milner

      • Jos C. M. Baeten, Bas Luttik, Paul van Tilburg

      Pages 1-20

   2. Concurrency and the Algebraic Theory of Effects

      • Gordon D. Plotkin

      Pages 21-22

   3. A Turing Enigma

      • Brian Randell

      Pages 23-36

   4. False Concurrency and Strange-but-True Machines

      • Peter Sewell

      Pages 37-38

3. Reachability Analysis

   1. Concurrent Games on VASS with Inhibition

      • Béatrice Bérard, Serge Haddad, Mathieu Sassolas, Nathalie Sznajder

      Pages 39-52

   2. Reachability Problem for Weak Multi-Pushdown Automata

      • Wojciech Czerwiński, Piotr Hofman, Sławomir Lasota

      Pages 53-68

   3. Reachability and Termination Analysis of Concurrent Quantum Programs

      • Nengkun Yu, Mingsheng Ying

      Pages 69-83

4. Qualitative and Timed Systems

   1. Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction

      • Guy Avni, Orna Kupferman

      Pages 84-99

   2. Avoiding Shared Clocks in Networks of Timed Automata

      • Sandie Balaguer, Thomas Chatain

      Pages 100-114

   3. Strategy Synthesis for Multi-Dimensional Quantitative Objectives

      • Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin

      Pages 115-131

   4. Quantitative Languages Defined by Functional Automata

      • Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin

      Pages 132-146

5. Behavioural Equivalences

   1. A Comparison of Succinctly Represented Finite-State Systems

      • Romain Brenguier, Stefan Göller, Ocan Sankur

      Pages 147-161

   2. All Linear-Time Congruences for Familiar Operators Part 2: Infinite LTSs

      • Antti Valmari

      Pages 162-176

6. Temporal Logics

   1. Quantified CTL: Expressiveness and Model Checking

      • Arnaud Da Costa, François Laroussinie, Nicolas Markey

      Pages 177-192

   2. What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic

      • Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi

      Pages 193-208

7. Session Types

   1. Specifying Stateful Asynchronous Properties for Distributed Programs

      • Tzu-Chun Chen, Kohei Honda

      Pages 209-224

   2. Synthesising Choreographies from Local Session Types

      • Julien Lange, Emilio Tuosto

      Pages 225-239

8. Abstraction

   1. A Theory of History Dependent Abstractions for Learning Interface Automata

      • Fides Aarts, Faranak Heidarian, Frits Vaandrager

      Pages 240-255

   2. Linearizability with Ownership Transfer

      • Alexey Gotsman, Hongseok Yang

      Pages 256-271

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