DOTS'10
International
Workshop on
Distributed Open Timed Systems
Paris, France,
September 4, 2010
Important Dates:
Deadline for papers (abstracts): May 25,
2010 (closed)
Notification of paper acceptance: June 20, 2010
Workshop: September 4, 2010
|
Scope and Topics
Invited Speaker
Programme
Programme Committee
Registration & Accommodation
Submission and Publication
Scope
The
DOTS
project (Distributed Open Timed Systems), funded by the French National Agency for Research,
is focused on
the combinations of three aspects of concurrent systems:
- timing and, more generally, quantitative requirements involved
in real time or probabilistic systems,
- interactions between open systems and their environment,
- communications between components of distributed systems.
While these features are rather well understood when considered
separately, there remain challenging issues in their combinations.
The aim of the DOTS project was precisely to develop verification and
control methods for such systems. The main techniques involved in this
project are based on games and partial orders.
The purpose of this workshop is to gather researchers interested in
modeling and analysis of concurrent systems featuring at least two of the above
aspects. Relevant topics include, but are not limited to:
- Modeling formalisms like timed and/or probabilistic automata,
timed and/or distributed games: semantic properties, verification methods
and partial order based techniques,
- Control or diagnosis problems with possible quantitative requirements
for such models: synthesis, robustness and implementability,
- Security problems in this context: modelling of distributed and/or timed
non interference or covert channels, verification and synthesis, with possible
relations to information theory,
- Case studies involving complex systems.
Invited Speaker
- Krishnendu Chatterjee. Games with Finitary Parity and Streett Objectives
Abstract:
In this talk we will present games with finitary parity and Streett objectives. The class of finitary objectives is a stronger condition than classcial \omega-regular conditions, and we will discuss how it gets rid of certain weakness of classical infinitary formulation. In this talk we will present results related to determinacy of these games, present algorithms and complexity for solving these games, and characterize the memory requirements of winning strategies. Our algorithms can be used, for example, for synthesizing controllers that do not let the response time of a system increase without bound.
Programme
| 09:20 - 09:30 | Welcome - Introduction |
|---|
| 09:30 - 10:30 | Invited talk by K. Chatterjee,
common with the GASICS workshop. Games with Finitary Parity and Streett Objectives |
| 10:30 - 11:00 | Coffee break |
|---|
| 11:00 - 11:30 | F. Avellaneda, R. Morin. Divergence and channel-bound
of high-level message sequence charts revisited |
| 11:30 - 12:00 | B. Bollig, S. Haar, L. Helouët. Diagnosis with Dynamic
MSC Languages |
| 12:00 - 12:30 | P. Bouyer-Decitre, N. Markey, O. Sankur, C. Thrane.
Making Timed Automata Robust |
| 12:30 - 14:30 | Lunch break |
|---|
| 14:30 - 15:00 | B. Grabiec, C. Jard, A. Legay. Unfolding Petri nets
under partial observation |
| 15:00 - 15:30 | R. Jaubert, P.A. Reynier. How robust is your favorite
timed automaton? |
| 15:30 - 16:00 | Coffee break - Closing |
|---|
- Benedikt Bollig (LSV, Cachan, France)
- Serge Haddad (LSV, Cachan, France)
- Loïc Helouët (IRISA, Rennes, France)
- Claude Jard (IRISA, Rennes, France)
- François Laroussinie (LIAFA, Paris, France)
- Olivier H. Roux (IRCCyN, Nantes, France)
- Igor Walukievicz (LaBRI, Bordeaux, France)
- Marc Zeitoun (LaBRI, Bordeaux, France)
Registration &
Accommodation
Please register for the DOTS'10 workshop as part of the
CONCUR 2010 registration
Information about how to get to the conference site and about hotels can be found at the conference
web site.
Submission and publication
Please submit a 1 page abstract by directly sending it as a PDF file to
Béatrice Bérard
The accepted abstracts (or extended versions, if the authors wish it) will be made available on the workshop website.