From post

Complete enumeration of minimal siphons in ordinary Petri nets based on problem partitioning

, , , и . 2015 54th IEEE Conference on Decision and Control (CDC), стр. 356--361. IEEE, (декабря 2015)
DOI: 10.1109/cdc.2015.7402226

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 three-stage deadlock prevention strategy for S3PR nets., , и . CASE, стр. 286-291. IEEE, (2015)A Deadlock Prevention Policy for a Class of Multithreaded Software., , , , , , и . IEEE Access, (2020)A method of computing strict minimal siphons in an S3PR based on resource circuits., , и . CDC, стр. 2785-2790. IEEE, (2010)Learning-Inspired Immune Algorithm for Multiobjective-Optimized Multirobot Maritime Patrolling., , , , и . IEEE Internet Things J., 11 (6): 9870-9881 (марта 2024)Extracting all minimal siphons from maximal unmarked siphons in manufacturing-oriented Petri nets., , и . CASE, стр. 399-404. IEEE, (2011)New reachability trees for analyzing unbounded Petri nets with semilinear reachability sets., , и . Sci. China Inf. Sci., 61 (12): 129104:1-129104:3 (2018)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)Complete enumeration of minimal siphons in ordinary Petri nets based on problem partitioning., , , и . CDC, стр. 356-361. IEEE, (2015)Synthesis of Petri nets controller for the constraints involving marking vector and Parikh vector., и . SMC (2), стр. 1705-1710. IEEE, (2004)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)