论文信息 - A zero-one programming of Petri nets to colored Petri net transformation

A zero-one programming of Petri nets to colored Petri net transformation

Presents a zero-one programming of transforming an ordinary Petri net into a colored Petri net. The transformation is based on the similarity measures embedded in the initial Petri net. The objective function is to maximize the compactness of the colored Petri net subject to the constraints which are defined on places and transitions of the initial Petri net. The application of the model is illustrated using an example.<<ETX>>

Mohsen A. Jafari | Houshang Darabi

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

[2] Y. Narahari,et al. On the invariants of coloured Petri nets , 1985, Applications and Theory in Petri Nets.

[3] Robert M. Shapiro,et al. Modeling an NORAD Command Post Using SADT and Colored Petri Nets , 1993, Functional Programming, Concurrency, Simulation and Automated Reasoning.

[4] Yadati Narahari,et al. A Petri net approach to the modelling and analysis of flexible manufacturing systems , 1985 .

[5] C. Petri. Kommunikation mit Automaten , 1962 .

[6] Manuel Silva,et al. A Language for the Description of Concurrent Systems Modeled by Colored Petri Nets: Application to the Control of Flexible Manufacturing Systems , 1985 .

[7] Y. Narahari,et al. Coloured Petri net models for automated manufacturing systems , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[8] Kurt Jensen. How to Find Invariants for Coloured Petri Nets , 1981, MFCS.

[9] Kurt Jensen,et al. Coloured Petri Nets and the Invariant-Method , 1981, Theor. Comput. Sci..

[10] Joseph Sifakis,et al. Structural Properties of Petri Nets , 1978, MFCS.

[11] Mohsen A. Jafari,et al. An architecture for a shop-floor controller using colored Petri nets , 1992 .