A DESCRIPTION OF PROCESSES OF TIMED PETRI NETS
|
Abstract:
Petri nets are a widely accepted model of concurrent systems. Originally they were invented for modelling those aspects of system behaviours which can be expressed in terms of causality and choice. Recently a growing interest can be observed in modelling real-time systems, which implies a need of a representation of the lapse of time. To meet this need various solutions has been proposed known as timed Petri nets (cf. [Ram 74]). For the usual Petri nets there exist precise characterisations of behaviours (cf. [DMM 89], for example). In the case of timed Petri nets the situation is less advanced since the existing semantics either do not reflect properly concurrency (cf. [GMMP 89], for a review) or they oversimplify the representation of the lapse of time (as in [BG 92]). In this paper we try to fill up this gap by representing the behaviour of a timed net by an algebra of structures called concatenable weighted pomsets. These structures correspond to concatenable processes of [DMM 89] with some extra information about the lapse of time. If the lapse of time is represented
Citations
| 223 | Modelling concurrency with partial orders – Pratt - 1986 |
| 86 | Analysis of asynchronous concurrent systems by Timed Petri Nets – Ramchandani - 1974 |
| 6 | Concatenable Weighted Pomsets and Their Applications to Modelling – Winkowski - 1985 |
| 4 | A General Way to Put Time – Ghezzi, Mandrioli, et al. - 1989 |
| 3 | Timing Petri Nets Categorically – Brown, Gurr - 1992 |
| 3 | An Algebraic Description of Processes of Timed Petri Nets – Winkowski - 1994 |
