Author
Listed:
- V. Chandra
- Z. Huang
- W. Qiu
- R. Kumar
Abstract
Interaction of multiple discrete event systems (DESs) represented as automata are carried out using composition operations. These operations on automata enforce concurrency, wherein an event exists in the composed automaton if it exists in the participating states of the interacting automata possessing the event in their event set. Heymann generalized this by introducing event priorities, wherein an event exists in the composed automaton if it exists in the participating state of the interacting automata having priority over the event. For two interacting automata P and Q, while prioritized composition can model the P, Q, AND, and OR boolean interactions, it cannot model boolean interactions which require exclusivity of participation, namely, “exclusive P”, “exclusive Q”, “exclusive P or exclusive Q”, “exclusive P and exclusive Q”. In order to also model these additional interactions we propose a generalization of prioritized composition by introducing an exclusivity set besides the existing priority sets. The resulting composition is called prioritized composition with exclusion. We also introduce prioritized composition with exclusion and generation that allows for all sixteen boolean modes of interaction possible when two automata interact. This is done by the further introduction of a nor-generative set. This event set together with the two priority sets and an exclusivity set makes it possible to model eight additional boolean interactions which do not require either of the interacting automata to participate for the event to be enabled in the composed automaton. The applicability of these interactions to decentralized supervisory decision fusion and in composing the rules based model of systems has been illustrated.
Suggested Citation
V. Chandra & Z. Huang & W. Qiu & R. Kumar, 2003.
"Prioritized Composition With Exclusion and Generation for the Interaction and Control of Discrete Event Systems,"
Mathematical and Computer Modelling of Dynamical Systems, Taylor & Francis Journals, vol. 9(3), pages 255-280, September.
Handle:
RePEc:taf:nmcmxx:v:9:y:2003:i:3:p:255-280
DOI: 10.1076/mcmd.9.3.255.24151
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:nmcmxx:v:9:y:2003:i:3:p:255-280. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/NMCM20 .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.