October 9 October 10 October 11
9:30-10:15 Volker Diekert: Partially commutative inverse monoids Paul Gastin: Characterizations of local safety and local liveness for traces 9:30-10:15 Ingmar Meinecke: Weighted distributed systems and their logics
10:15-10:45 Barbara Klunder, Krystyna Stawikowska: Word languages from trace viewpoint Madhavan Mukund: Local testing for HMSC specifications 10:15-11:00 Daniel Kirsten: Star and star height problems for trace monoids
10:45-11:15 COFFEE BREAK 11:00-11:30 COFFEE BREAK
11:15-12:00 Manfred Droste: Weighted trace automata Anca Muscholl: Algorithms for communicating systems 11:30-12:15 Stefano Crespi Reghizzi, Simone Campanoni: Traces of control-flow graphs
12:00-12:45 Dietrich Kuske: Which local temporal logics are tractable? Marc Zeitoun: Distributed games and control 12:15-12:45 K. Narayan Kumar: Model checking time-constrained HMSCs
12:45 LUNCH 12:45 LUNCH
14:00-14:45 Edward Ochmanski: Lights and Darks of the Star-Free Star Luca Breveglieri, Massimiliano Goldwurm: Algorithm for recognition of regular trace languages
14:45-15:15 Markus Lohrey: Decision problems in graph groups A. Cano Gomez, Giovanna Guaiana, Jean-Eric Pin: When does partial commutative closure preserve regularity?
15:15-15:45 Manfred Kufleitner: A new algebraic framework for recognizable trace languages Alberto Bertoni, Roberto  Radicioni: Approximation of the mean speedup in trace monoids and random generation of traces
15:45-16:15 COFFEE BREAK
16:15-16:45 Rémi Morin: Partial order semantics of shared-memory systems Luca Breveglieri, Alessandra Cherubini, Claudia Nuccio, Emanuele Rodaro: NP-completeness of the alphabetical satisfiability  problem for trace equations
16:45-17:15 Joanna Jolkowska: Traceability and Concurrent Fairness in Petri Nets Nicoletta Sabadini, L.De Francesco Albasini, R. Walters: CospanSpan(Graphs): a compositional model for reconfigurable automata nets
17:15-18:15 Panel Discussion