Operational analysis of timed Petri nets and application to the computation of performance bounds. (English) Zbl 0845.68077
Baccelli, F. (ed.) et al., Quantitative methods in parallel systems. Berlin: Springer-Verlag. ESPRIT Basic Res. Ser. 161-174 (1995).
Summary: We use operational analysis techniques to partially characterize the behaviour of timed Petri nets under very weak assumptions on their timing semantics. New operational inequalities are derived that are typical of the presence of synchronization and that were therefore not considered in queueing network models.
We show an interesting application of the operational laws to the statement and the efficient solution of problems related to the estimation of performance bounds insensitive to the timing probability distributions. The results obtained generalize and improve in a clear setting results that were derived in the last few years for several different subclasses of timed Petri nets. In particular, the extension to well-formed coloured nets appears straightforward and allows an efficient exploitation of models symmetries.
For the entire collection see [Zbl 0824.00021].
We show an interesting application of the operational laws to the statement and the efficient solution of problems related to the estimation of performance bounds insensitive to the timing probability distributions. The results obtained generalize and improve in a clear setting results that were derived in the last few years for several different subclasses of timed Petri nets. In particular, the extension to well-formed coloured nets appears straightforward and allows an efficient exploitation of models symmetries.
For the entire collection see [Zbl 0824.00021].
MSC:
| 68Q85 | Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) |
