PRIORITIES AS A BASIS FOR CONTROL IN NONSEQUENTIAL SYSTEMS
Most programming languages or modeling systems use either sequential control or, in the other extreme, complete concurrency. We propose here a control structure consisting essentially of dynamic priority relations between elementary steps. Elementary steps may be executed if they are "enabled" executable and if at that time no other elementary step with a higher priority is enabled. This leaves much room for concurrency. Priorities can be changed after executing a step. Such a control structure can be imposed on Petri nets; this has been investigated more closely for the modeling language MoMo i.e., for its task layer , which is based on colored Petri nets. The proposed task layer language is presented here in some detail. It has been tried out with several medium-size examples selected to find out to which limits this control principle is feasible. Few priorities have been
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media