Easy synchronized Petri nets as discrete event models
- 1 January 1990
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2839-2844 vol.5
- https://doi.org/10.1109/cdc.1990.203297
Abstract
Linguistic concepts are introduced to relate Petri net models with the control theory for discrete event systems. Petri net structures can be considered as language generators, and different languages associated with them are examined. An important operator, synchronization, is introduced and its counterpart on a Petri net structure is studied. Finally, the authors introduce the concept of easiness, and study how this property is preserved by synchronization. A net is easy when the solution of the state equation gives a sufficient condition for reachability. The main result is that, although easiness is not preserved in general by synchronization, one can define classes of synchronization that are easiness-invariant.Keywords
This publication has 6 references indexed in Scilit:
- Petri nets: Properties, analysis and applicationsProceedings of the IEEE, 1989
- The control of discrete event systemsProceedings of the IEEE, 1989
- Finitely recursive process models for discrete event systemsIEEE Transactions on Automatic Control, 1988
- Supervisory Control of a Class of Discrete Event ProcessesSIAM Journal on Control and Optimization, 1987
- Models for simulation and discrete control of manufacturing systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- A Petri net approach to the modelling and analysis of flexible manufacturing systemsAnnals of Operations Research, 1985