论文信息 - Analyzing Paths in Time Petri Nets

Analyzing Paths in Time Petri Nets

In this paper, a parametric description of a transition sequence in a Time Petri net is introduced. The minimal and maximal time duration of a transition sequence are shown to be integers and furthermore the min/max path passes only integer-states. A necessary condition for the reachability of an arbitrary state is given.

Louchka Popova-Zeugmann | Dirk Schlatter | Dirk Schlatter | L. Popova-Zeugmann

[1] Louchka Popova-Zeugmann,et al. On Time Petri Nets , 1991, J. Inf. Process. Cybern..

[2] Philip Meir Merlin,et al. A study of the recoverability of computing systems. , 1974 .

[3] W.M.P. van der Aalst,et al. Timed coloured Petri nets and their application to logistics , 1992 .

[4] Louchka Popova-Zeugmann,et al. Essential States in Time Petri Nets , 1991 .

[5] Louchka Popova-Zeugmann,et al. Worst-case Analysis of Concurrent Systems with Duration Interval Petri Nets , 1997 .

[6] Bernard Berthomieu,et al. An Enumerative Approach for Analyzing Time Petri Nets , 1983, IFIP Congress.

[7] M. Diaz,et al. Modeling and Verification of Time Dependent Systems Using Time Petri Nets , 1991, IEEE Trans. Software Eng..

[8] Hanifa Boucheneb,et al. Occurrence Graphs for Interval Timed Coloured Nets , 1994, Application and Theory of Petri Nets.