|
|
Welcome |
|
|
Teaching |
|
|
Research |
|
|
Projects |
|
|
CV |
|
|
Contact info |
|
|
Other stuff |
|
|
Links |
This talk discusses some formalisms and languages (both graphical and textual) for modelling discrete-event systems with time-dependent behaviour. Some of the formalisms discussed are Statecharts, DEVS, Timed Petri Nets, Timed Automata, as well as process algebras such as Timed CSP and Timed CCS and some derived languages like LOTOS. We present informally a small language which can be considered a variation on Timed CSP or Timed CCS which allows some form of mobility in the style of the p-calculus. A simple application to traffic modelling is discussed.
The slides are available in the following formats: