List of Accepted Papers for CONCUR 2006

Congratulations to the authors whose papers were selected for CONCUR 2006. The conference programme promises to be very interesting, and bears witness to the vitality of concurrency theory as a research area.

List of accepted papers:

1 Transition Systems of Elementary Net Systems
with Localities
Maciej Koutny, Marta Peitkiewicz-Koutny

3 Model Checking Quantified Computation Tree Logic
Arend Rensink

14 Encoding CDuce in the Cphi-calculus
Guiseppe Castagna, Mariangiola Dezani-Ciancaglini,
Daniele Varacca

17 A New Type System for Deadlock-Free Processes
Naoki Kobayashi

20 Strategy Improvement for Stochastic Rabin and
Streett Games
Krishnendu Chatterjee, Thomas Henzinger

22 On Finite Alphabets and Infinite Bases III: Simulation
Taolue Chen, Wan Fokkink

26 A Complete Axiomatization of Branching Bisimulation
for Probabilistic Systems, with an Application in
Protocol Verification
Suzana Andova, Jos baeten, Tim Willemse

30 Event Structure Semantics for Nominal Calculi
Roberto Bruni, Herman Megratti, Ugo Montanari

37 Sortings for Reactive Systems
Lars Birkedal, Soren Debois, Thomas Hildebrandt

43 Probabilistic I/O Automata: Theories of Two Equivalences
Eugene Stark, Rance Cleaveland, Scott Smolka

44 A Capability Calculus for Concurrency and Determinism
Tachio Terauchi, Alex Aiken

45 Dynamic Access Control in a Concurrent Object Calculus
Avik Chaudhuri

46 A Complete Axiomatic Semantics for the CSP
Stable-Failures Model
Yoshinao Isobe, Marcus Roggenbach

52 Inference of Event-Recording Automata Using
Timed Decision Trees
Olga Grinchtein, Bengt Jonsson, Paul Petterson

57 Reachability in Recursive Markov Decision Processes
Tomas Brazdil, Vaclav Brozek, Vojtech Forejt, Antonin Kucera

58 Second-Order Simple Grammars
Colin Stirling

60 Weak Bisimulation up to Elaboration
Damien Pous

61 Controller Synthesis for MTL Specifications
Patricia Boyer, Laura Bozzelli, Fabrice Chevalier

65 Finding Shortest Witnesses to the Nonemptiness
of Automata on Infinite Words
Orna Kupferman, Sarai Sheinvald

69 Operational Determinism and Fast Algorithms
Henri Hansen, Antti Valmari

75 Liveness, Fairness and Impossible Futures
Rob van Glabbeek, Marc Voorhoeve

79 Concurrent Rewriting for Graphs with Equivalences
Paolo Baldan, Fabio Gadduducci, Ugo Montanari

81 Proving Liveness by Backward Reachability
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine,
Mayank Saksena

84 A Livelock Freedom Analysis for Infinite State
Asynchronous Reactive Systems
Stefan Leue, Alin Stefanescu, Wei Wei

86 On Interleaving in Timed Automata
Ramzi Ben Salah, Marius Bozga, Oded Maler

92 Generic Forward and Backward Simulation
Ichiro Hasuo

108 Minimization, Learning, and Conformance Testing
of Boolean Programs
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan

110 A Language for Task Orchestration and its
Semantic Properties
William Cook, David Kitchin, Jayadev Misra

123 Checking a Mutex Algorithm in a Process Algebra
with Fairness
Flavio Corradini, Maria Rita Di Berardini, Walter Vogler