CONCUR 2009 - Concurrency Theory

1. Front Matter

   PDF

2. Invited Papers

   1. Perspectives on Transactional Memory

      • Martín Abadi, Tim Harris

      Pages 1-14

   2. The Effect of Tossing Coins in Omega-Automata

      • Christel Baier, Nathalie Bertrand, Marcus Größer

      Pages 15-29

   3. Bigraphical Categories

      • Robin Milner

      Pages 30-36

   4. BlenX Static and Dynamic Semantics

      • Corrado Priami, Paola Quaglia, Alessandro Romanel

      Pages 37-52

3. Contributed Papers

   1. Flow Policy Awareness for Distributed Mobile Code

      • Ana Almeida Matos

      Pages 53-68

   2. Volume and Entropy of Regular Timed Languages: Discretization Approach

      • Eugene Asarin, Aldric Degorre

      Pages 69-83

   3. A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types

      • Steffen van Bakel, Maria Grazia Vigliotti

      Pages 84-98

   4. Encoding Asynchronous Interactions Using Open Petri Nets

      • Paolo Baldan, Filippo Bonchi, Fabio Gadducci

      Pages 99-114

   5. Distributed Asynchronous Automata

      • Nicolas Baudru

      Pages 115-130

   6. Algebra for Infinite Forests with an Application to the Temporal Logic EF

      • Mikołaj Bojańczyk, Tomasz Idziaszek

      Pages 131-145

   7. Deriving Syntax and Axioms for Quantitative Regular Behaviours

      • Filippo Bonchi, Marcello Bonsangue, Jan Rutten, Alexandra Silva

      Pages 146-162

   8. Weighted Bisimulation in Linear Algebraic Form

      • Michele Boreale

      Pages 163-177

   9. A Logic-Based Framework for Reasoning about Composite Data Structures

      • Ahmed Bouajjani, Cezara Drăgoi, Constantin Enea, Mihaela Sighireanu

      Pages 178-195

   10. Measuring Permissivity in Finite Games

       • Patricia Bouyer, Marie Duflot, Nicolas Markey, Gabriel Renault

       Pages 196-210

   11. Contracts for Mobile Processes

       • Giuseppe Castagna, Luca Padovani

       Pages 211-228

   12. Power of Randomization in Automata on Infinite Strings

       • Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan

       Pages 229-243

   13. Probabilistic Weighted Automata

       • Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger

       Pages 244-258

   14. Partially-Commutative Context-Free Processes

       • Wojciech Czerwiński, Sibylle Fröschle, Sławomir Lasota

       Pages 259-273

   15. Testing Finitary Probabilistic Processes

       • Yuxin Deng, Rob van Glabbeek, Matthew Hennessy, Carroll Morgan

       Pages 274-288

This volume contains the proceedings of the 20th Conference on Concurrency Theory (CONCUR 2009), held in Bologna, September 1–4, 2009. The purpose of the CONCUR conference is to bring together researchers, developers, and s- dentsinordertoadvancethetheoryofconcurrencyandpromoteitsapplications. This year the CONCUR conference was in its 20th edition, and to celebrate 20 years of CONCUR, the conference program included a special session organized by the IFIP Working Groups 1.8 “Concurrency Theory” and 2.2 “Formal - scriptionofProgrammingConcepts”aswellas aninvitedlecturegivenby Robin Milner, one of the fathers of the concurrency theory research area. This edition of the conference attracted 129 submissions. We wish to thank all their authors for their interest in CONCUR 2009. After careful discussions, the Program Committee selected 37 papers for presentation at the conference. Each of them was accurately refereed by at least three reviewers (four reviewers for papers co-authored by members of the Program Committee), who delivered detailedandinsightfulcommentsandsuggestions.TheconferenceChairswarmly thank all the members of the Program Committee and all their sub-referees for the excellent support they gave, as well as for the friendly and constructive discussions. We would also like to thank the authors for having revised their papers to address the comments and suggestions by the referees. The conference program was enriched by the outstanding invited talks by Martin Abadi, Christel Baier, Corrado Priami and, as mentioned above, Robin Milner.

• cloud computing
• concurrent processing
• concurrent systems
• data structures
• distributed computing
• linear algebra
• logic
• model checking
• performance
• pervasive computing
• process calculi
• systems biology
• verification

• Department of Computer Science, University of Bologna, Bologna, Italy

  Mario Bravetti, Gianluigi Zavattaro

Policies and ethics