For the most recent entries see the Petri Nets Newsletter.

Implementation of Weighted Place/Transition Nets based on Linear Enabling Functions.

Briz, J.L.; Colom, J.M.

In: Valette, R.: Lecture Notes in Computer Science, Vol. 815; Application and Theory of Petri Nets 1994, Proceedings 15th International Conference, Zaragoza, Spain, pages 99-118. Springer-Verlag, 1994.

Abstract: Petri Nets should be implemented in an efficient and reliable way, specially when they are going to be used for critical problems, like that of giving support to Discrete Event Systems Simulation, whichever sequential or parallel strategies are adopted. One of the critical points while implementing a Petri Net, is that of determining whether a transition is enabled. In this contribution we classify transitions in several classes. The enabling of a transition is characterized by means of a Linear Enabling Function (LEF), that depends on the class. For some classes a transformation must be applied, preserving the behaviour of the net. We show how LEFs can be applied to build a Simulation Engine tht uses as data structure a DES described in terms of a Timed Petri Net, taking benefit of the properties of LEFs.

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

Back to the Petri Nets Bibliography