For the most recent entries see the Petri Nets Newsletter.

An algebraic approach to model complex sequencing problems.

Laupera, F.G.; Lasquo, M.M.; Laupera, M.B.

In: Proc. 9th IFAC Symp. on Information Control in Manufacturing (INCOM'98), 24-26 June 1998, Nancy-Metz, France, Vol. 2, pages 135-140. 1998.

Abstract: The paper proposes anew approach to the modeling of complex sequencing problems. After a brief presentation of classical results obtained with generalized stochastic Petri nets (GSPNs), the paper proposes solutions based upon an algebraic tool. It is thus possible to express each complex sequencing problem by a mono or multi-variable polynomial function defined on a characteristic p field. This model enables the representation of temporal aspects, as well as failure recovery of real-time systems.

Keywords: error recovery, finite fields algebra, real-time systems, sequencing problems, stochastic Petri nets, timing analysis.


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

Back to the Petri Nets Bibliography