For the most recent entries see the Petri Nets Newsletter.

Studies on the Minimum Initial Marking of a Class of Hybrid Timed Petri Nets.

Dai, Huaping

In: Lecture Notes in Computer Science, Vol. 3645, pages 109-118. 2005.

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.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography