RELATIONSHIPS BETWEEN PETRI NETS AND CONSTRAINT GRAPHS: APPLICATION TO MANUFACTURING

The purpose of the paper is to compare timed and time Petri nets with constraint satisfaction problems and activity-on-arc graphs in the context of manufacturing. It is shown that constraints are not defined in the same way but that timed and time Petri nets could be translated into a set of activity-on-arc graphs. This translation is only straightforward for p-timed and p-time Petri nets.

[1]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[2]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

[3]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[4]  Eddie Schwalb,et al.  Temporal Constraints: A Survey , 1998, Constraints.

[5]  Robert Valette,et al.  Scenario durations characterization of t-timed Petri nets using linear logic , 1999, Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331).

[6]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[7]  Salah E. Elmaghraby,et al.  Activity networks: Project planning and control by network models , 1977 .