For the most recent entries see the Petri Nets Newsletter.

PN to CSP Methodology: Improved Bounds.

Riera, Daniel; Piera, Miquel A.; Guasch, Antoni

In: Topics in Artificial Intelligence, Proceedings of the 5th Catalonian Conference on AI, CCIA 2002, Castellón, Spain, October 24-25, 2002, pages 145-158. Volume 2504 of Lecture Notes in Artificial Intelligence / M.T. Escrig, F. Toledo, E. Golobardes (Eds.) --- Springer Verlag, October 2002.

Abstract: Traditional production planning techniques are constrained by large numbers of decision variables, uncertainty in demand and time production, and non-deterministic system behaviour (intrinsic characteristics in manufacturing). This paper presents an improvement to a methodology in the area of Knowledge Based Systems (KBS) which generates automatically Constraint Satisfaction Problems (CSP), using Petri-nets (PN) to model the problem and Constraint Programming (CP) in the solution. The methodology combines the modelling power of PN to represent both manufacturing architecture and production logistics, together with the optimisation performance given by CP. While PN can represent a whole production system, CP is effective in solving large problems, especially in the area of planning. The improvement raises from the design of a more complete algorithm to calculate the transitions firings bounds, and hence to remove useless problem variables.

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

Back to the Petri Nets Bibliography