The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper proposes a divide-and-conquer method to synthesize non-blocking supervisors for a class of generalized Petri nets, namely G-system. A novel deadlock prevention method is presented by utilizing the reachability graph (RG). Due to the RG of a large Petri net model (PNM) easily becomes unmanageable, an optimal non-blocking supervisor based on RG becomes a challenging problem in a generalized...
Timed marked graphs (TMGs), a special class of Petri nets, are used to model and analyze cyclic manufacturing systems. Weighted marked graphs (WMGs) are convenient to model systems with bulk services and arrivals. It is possible to apply analytical techniques for the marking optimization problem of such systems. The problem consists in minimizing the cost associated with an initial marking that ensures...
The growing use of multiprocessing systems has given rise to the necessity of modeling, verifying, and evaluating their performance, in order to fully exploit hardware [9], [15], [16]. The Petri Net (PN) formalism is a suitable tool for modeling parallel systems, because of basic characteristics of these systems, like parallelism and process synchronization. The system under study can be evaluated...
In order to solve the parallel algorithm for Petri nets system with concurrent function, to realize the parallel control and execution of the Petri nets, the Petri nets parallel subnets conditions were proposed, that provides the theory basis for judging P- invariant whether was the parallel subnet. Firstly, we according to the concurrent character of Petri net model, to analyze the parallelism of...
Petri nets, or equivalently vector addition systems (VAS), are widely recognized as a central model for concurrent systems. Many interesting properties are decidable for this class, such as bounded ness, reach ability, regularity, as well as context-freeness, which is the focus of this paper. The context-freeness problem asks whether the trace language of a given VAS is context-free. This problem...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.