From post

A Method to Compute Strict Minimal Siphons in a Class of Petri Nets Based on Loop Resource Subsets

, , , и . IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 42 (1): 226--237 (января 2012)
DOI: 10.1109/tsmca.2011.2159590

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

A Method to Compute Strict Minimal Siphons in a Class of Petri Nets Based on Loop Resource Subsets, , , и . IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 42 (1): 226--237 (января 2012)Extracting all minimal siphons from maximal unmarked siphons in manufacturing-oriented Petri nets., , и . CASE, стр. 399-404. IEEE, (2011)Supervisor synthesis for enforcing linear constraints on a class of Petri nets with unobservable transitions., , , и . IMA J. Math. Control. Inf., 34 (2): 565-577 (2017)Computation of an Optimal Transformed Linear Constraint in a Class of Petri Nets With Uncontrollable Transitions., , , и . IEEE Access, (2017)A New Modified Reachability Tree Approach and Its Applications to Unbounded Petri Nets., , , и . IEEE Trans. Syst. Man Cybern. Syst., 43 (4): 932-940 (2013)Necessary and sufficient conditions for resultant siphons to be controlled., , и . ACC, стр. 4484-4489. IEEE, (2011)A transformation algorithm for optimal admissible generalized mutual exclusion constraints on Petri nets with uncontrollable transitions., , и . ICRA, стр. 3745-3750. IEEE, (2011)Optimal siphon-based deadlock prevention policy for a class of Petri nets in automation., , и . SMC, стр. 826-831. IEEE, (2011)An algorithm to find the condition on initial markings of resource places and job places for liveness of S3PMR., , и . ICCA, стр. 1445-1449. IEEE, (2010)A method of computing strict minimal siphons in an S3PR based on resource circuits., , и . CDC, стр. 2785-2790. IEEE, (2010)