Young Researchers Workshop on Concurrency Theory

September 4, 2010

Paris, France

Aims and objectives

This workshop aims at providing a platform for PhD students and young researchers who recently completed their doctoral studies, to exchange new results related to concurrency theory and receive feedback on their research. Focus is on informal discussions. Excellent master students working on concurrency theory are also encouraged to contribute.


YR-CONCUR 2010 is a satellite workshop of CONCUR 2010, and will be held on Saturday September 4, 2010. It is anticipated that many CONCUR participants will attend the YR-workshop (and vice versa). Presentations are selected on the basis of an abstract of up to four pages (incl. references) describing the research. The accepted abstracts will be made available at the workshop, but no formal proceedings are planned. It is thus also allowed (and encouraged) to send results that have been published at other conferences (although preferably not at CONCUR 2010 or any of its other satellite workshops).


The Young Researchers Workshop on Concurrency Theory was first organised in 2009 (YR-CONCUR09) by Joost-Pieter Katoen as a satellite workshop of CONCUR 2009 in Bologna, Italy.


09:10-09:15 Opening
09:15-09:40 On Rule Formats for Zero and Unit Elements

Matteo Cimini (Reykjavik University, IS)
09:40-10:05 Turning GSOS Rules into Equations for Linear Time-Branching Time Semantics

Maciej Gazda (VU University Amsterdam, NL)
10:05-10:30 Reactive Turing Machines and ACPtau

Paul van Tilburg (Eindhoven University of Technology, NL)
10:30-11:00 Coffee break
11:00-11:25 Confluence Reduction for Probabilistic Systems

Mark Timmer (University of Twente, NL)
11:25-11:50 Compositional Abstraction and Refinement of Probabilistic Automata

Falak Sher (RWTH Aachen University, DE)
11:50-12:15 Scheduler-Quantified Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains

Georgel Ionuţ Călin (Saarland University, DE)
12:15-14:15 Lunch break
14:15-14:40 Topological, Automata-Theoretic and Logical Characterization of Finitary Languages

Nathanaël Fijalkow (IST Austria, AT and ENS Cachan, FR)
14:40-15:05 Inference and Abstraction of the Biometric Passport

Fides Aarts (Radboud University Nijmegen, NL)
15:05-15:30 Run Graphs of Communicating Processes and MSO

Alexander Heußner (Université Bordeaux 1, LaBRI, FR)
15:30-16:00 Coffee break
16:00-16:25 A Short Note on Desynchronisable Closed Loop System

Harsh Beohar (Eindhoven University of Technology, NL)
16:25-16:50 Bisimilarity in Concurrent Constraint Programming

Andrés A. Aristizábal P. (CNRS, LIX, École Polytechnique, FR)
Concurrent Pattern Calculus in bondi

Thomas Given-Wilson (University of Technology Sydney, AU)

Program Committee

  • Benedikt Bollig  (ENS Cachan, France)
  • Michele Boreale (Universita' di Firenze, Italy)
  • Bas Luttik (TU Eindhoven and VU Amsterdam, The Netherlands)
  • Nir Piterman (Imperial College, United Kingdom)
  • Pawel Sobocinski (University of Southhampton, United Kingdom)
  • Jiri Srba (Aalborg University, Denmark)
  • Frank Valencia (LIX, CNRS & Ecole Polytechnique, France)
  • Verena Wolf (Saarland University, Germany)