Time-independent Liveness in Time Petri Nets

• Autorzy: Bachmann J.P. , Popova-Zeugmann L.
• Języki publikacji: EN

Abstrakty

EN

In this paper we consider a class of Time Petri nets defined by structural restrictions. Each Time Petri net which belongs to this class has the property that their liveness behaviour does not depend on the time. Therefore, the Time Petri net is live when its skeleton is live.

Słowa kluczowe

EN

Petri net; Time Petri Net

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2010
• Tom: Vol. 102, nr 1
• Strony: 1--17
• Opis fizyczny: Bibliogr. 11 poz.

Twórcy

autor

Bachmann J.P.

autor

Popova-Zeugmann L.

• Department of Computer Science, Humboldt University, Berlin, Germany,

Bibliografia

• [1] Berthomieu, B. and Diaz, M. Modeling and Verification of Time Dependent Systems Using Time Petri Nets. In Advances in Petri Nets 1984, volume 17, No. 3 of IEEE Trans. on Software Eng., pages 259-273, 1991.
• [2] Berthomieu, B. and Menasche, M. An Enumerative Approach for Analyzing Time Petri Nets. In Proceedings IFIP Congress, September 1983.
• [3] E. Best. Structure Theory of Petri Nets: the Free Choice Hiatus. LNCS, 254:168-205, 1987.
• [4] L. Popova. On Time Petri Nets. J. Inform. Process. Cybern. EIK 27(1991)4, pages 227-244, 1991.
• [5] L. Popova-Zeugmann. Time Petri Nets State Space Reduction Using Dynamic Programming. Journal of Control and Cybernetics, 35(3):721-748, 2007.
• [6] L.Popova-Zeugmann. Time and Petri Nets (in German). Habilitation Thesis, Humboldt University at Berlin, Berlin, 2007.
• [7] L. Popova-Zeugmann and D. Schlatter. Analyzing Path in Time Petri Nets. Fundamenta Informaticae (FI) 37, IOS Press, Amsterdam, pages 311-327, 1999.
• [8] Kurt Lautenbach. Exakte Bedingungen der Lebendigkeit für eine Klasse von Petri-Netzen. Phd thesis, GMG, Bonn, 1973.
• [9] Didier Limeand Olivier (H.) Roux. State classtimed automa tonof atime Petri net.In The 10th International Workshop on Petri Nets and Performance Models, (PNPM'03), pages 124-133, Urbana, USA, September 2003. IEEE Computer Society.
• [10] Merlin, Ph.M. A Study of the Recoverability of Computing Systems. PhD thesis, University of California, Computer Science Dept., Irvine, January 1974.
• [11] Tadao Murata. Petri Nets: Properties, Analysis and Applications. In Proceedings of the IEEE, volume 77(4), pages 541-580, 1989.