Studies on the minimum initial marking of a class of hybrid timed Petri nets

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

For the minimum initial marking (MIM) problem is one of minimum resource allocation problems, it is significant to study the MIM problem for a class of hybrid timed Petri nets, called a hybrid timed event graph (HTEG). An HTEG has additional continuous places and continuous transitions than a timed event graph (TEG). By the construction of a new dioid endowed with the pointwise minimum as addition and the composition of functions as multiplication, a linear min-plus algebraic model of HTEG was derived. Based on the min-plus algebra and its properties, the MIM problem for HTEG was studied in the text. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Dai, H. (2005). Studies on the minimum initial marking of a class of hybrid timed Petri nets. In Lecture Notes in Computer Science (Vol. 3645, pp. 109–118). Springer Verlag. https://doi.org/10.1007/11538356_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free