CONCURLOGO THE 17th INTERNATIONAL CONFERENCE
ON CONCURRENCY THEORY
AUGUST 27 - 30, 2006
BONN, GERMANY 		BONNLOGO

Program


Program in pdf including Pre- and Post-Workshops
Sunday, August 27:
9:20 - 9:30 Welcome
9:30 - 10:30 Invited Talk, Joint with FMICS
Making Concurrency Mainstream
Edward Lee
10:30 - 11:00 Coffee Break
11:00 - 12:30 Model Checking
A Language for Task Orchestration and its Semantic Properties
David Kitchin, William Cook, Jayadev Misra
Proving Liveness by Backward Reachability
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, Mayank Saksena
10:00 - 10:30 Transition Systems of Elementary Net Systems with Localities
Maciej Koutny, Marta Peitkiewicz-Koutny
12:30 - 14:30 Lunch Break
14:30 - 16:00 Process Calculi
Liveness, Fairness and Impossible Futures
Rob van Glabbeek, Marc Voorhoeve
Checking a Mutex Algorithm in a Process Algebra with Fairness
Flavio Corradini, Maria Rita Di Berardini, Walter Vogler
A Complete Axiomatic Semantics for the CSP Stable-Failures Model
Yoshinao Isobe, Marcus Roggenbach
16:00 - 16:30 Coffee Break
16:30 - 18:00 Invited Tutorial
Welcome to the jungle: A Subjective Guide to Mobile Process Calculi
Uwe Nestmann
18:30 - 20:30 Reception
Monday, August 28:
9:00 - 10:00 Invited Talk
Definability and Process Graphs
Jan-Willem Klop
Model Checking Quantified Computation Tree Logic
Arend Rensink
10:30 - 11:00 Coffee Break
11:00 - 12:30 Minimization and Equivalence Checking
Operational Determinism and Fast Algorithms
Henri Hansen, Antti Valmari
Minimization, Learning, and Conformance Testing of Boolean Programs
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
A Capability Calculus for Concurrency and Determinism
Tachio Terauchi, Alex Aiken
12:30 - 14:30 Lunch Break
14:30 - 16:00 Types
A New Type System for Deadlock-Free Processes
Naoki Kobayashi
Sortings for Reactive Systems
Lars Birkedal, Soren Debois, Thomas Hildebrandt
Dynamic Access Control in a Concurrent Object Calculus
Avik Chaudhuri
16:00 - 16:30 Coffee Break
16:30 - 18:00 Invited Tutorial
Probability and Nondeterminism in Operational Models of Concurrency
Roberto Segala
Tuesday, August 29:
9:00 - 10:30 Semantics
Concurrent Rewriting for Graphs with Equivalences
Paolo Baldan, Fabio Gadducci, Ugo Montanari
Event Structure Semantics for Nominal Calculi
Roberto Bruni, Hernan Melgratti, Ugo Montanari
Encoding CDuce in the Cpi-calculus
Giuseppe Castagna, Mariangiola Dezani-Ciancaglini, Daniele Varacca
10:30 - 11:00 Coffee Break
11:00 - 12:30 Probability
A Complete Axiomatization of Branching Bisimulation for Probabilistic Systems, with an Application in Protocol Verification
Suzana Andova, Jos Baeten, Tim Willemse
Probabilistic I/O Automata: Theories of Two Equivalences
Eugene Stark, Rance Cleaveland, Scott Smolka
Reachability in Recursive Markov Decision Processes
Tomas Brazdil, Vaclav Brozek, Vojtech Forejt, Antonin Kucera
12:30 - 14:30 Lunch Break
15:00 Excursion and Banquet
Wednesday, August 30:
9:00 - 10:00 Invited Talk
Sanity Checks in Formal Verification
Orna Kupferman
10:00 - 10:30 Strategy Improvement for Stochastic Rabin and Streett Games
Krishnendu Chatterjee, Thomas Henzinger
10:30 - 11:00 Coffee Break
11:00 - 12:30 Bisimulation and Simulation
Weak Bisimulation up to Elaboration
Damien Pous
Generic Forward and Backward Simulation
Ichiro Hasuo
On Finite Alphabets and Infinite Bases III: Simulation
Taolue Chen, Wan Fokkink
12:30 - 14:30 Lunch Break
14:30 - 16:00 Real Time
Inference of Event-Recording Automata Using Timed Decision Trees
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
Controller Synthesis for MTL Specifications
Patricia Bouyer, Laura Bozzelli, Fabrice Chevalier
On Interleaving in Timed Automata
Ramzi Ben Salah, Marius Bozga, Oded Maler
16:00 - 16:30 Coffee Break
16:30 - 18:00 Formal Languages
A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems
Stefan Leue, Alin Stefanescu, Wei Wei
Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
Orna Kupferman, Sarai Sheinvald-Faragy
Second-Order Simple Grammars
Colin Stirling
18:00 Closing