Hierarchical timed high level nets and their branching processes
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Algebraical Characterisation of Interval-Timed Petri Nets with Discrete Delays
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
| Hi-index | 0.00 |
The paper aims at comparing various timed extensions of a fully compositional class of high-level Petri nets, called M-nets. On one hand, as a classical approach, a class of timed M-nets is considered, where intervals of duration are attached to each transition. More precisely, we study this class enriched by the recently introduced hierarchical operation of timed refinement. On the other hand, M-nets enriched by the causal time concept [23, 34] are considered, they are called causal time M-nets and allow to introduce timing constraints without extending the original untimed model of M-nets. Causal timeM-nets are shown to form the more powerful class. It covers timed and even hierarchical timed M-nets. Moreover, as shown by some significant examples, it permits the modelling of systems involving overlappingtiming constraints. Some special cases are quoted where hierarchical timed M-nets may become favorite.