Chengying Wang

According to our database1, Chengying Wang authored at least 16 papers between 2010 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Supervisor synthesis for enforcing linear constraints on a class of Petri nets with unobservable transitions.
IMA J. Math. Control. Inf., 2017

Computation of an Optimal Transformed Linear Constraint in a Class of Petri Nets With Uncontrollable Transitions.
IEEE Access, 2017

2016
Optimal supervisor synthesis for petri nets with uncontrollable transitions: A bottom-up algorithm.
Inf. Sci., 2016

2013
A New Modified Reachability Tree Approach and Its Applications to Unbounded Petri Nets.
IEEE Trans. Syst. Man Cybern. Syst., 2013

Design of Optimal Monitor-Based Supervisors for a Class of Petri Nets With Uncontrollable Transitions.
IEEE Trans. Syst. Man Cybern. Syst., 2013

Design of Liveness-Enforcing Supervisors for S3PR Based on Complementary Places.
ACM Trans. Embed. Comput. Syst., 2013

2012
A Method to Compute Strict Minimal Siphons in a Class of Petri Nets Based on Loop Resource Subsets.
IEEE Trans. Syst. Man Cybern. Part A, 2012

Controllability Conditions of Resultant Siphons in a Class of Petri Nets.
IEEE Trans. Syst. Man Cybern. Part A, 2012

Computation of all minimal siphons in Petri nets.
Proceedings of 9th IEEE International Conference on Networking, Sensing and Control, 2012

2011
Comments on "Siphon-Based Deadlock Prevention Policy for Flexible Manufacturing Systems".
IEEE Trans. Syst. Man Cybern. Part A, 2011

Optimal siphon-based deadlock prevention policy for a class of Petri nets in automation.
Proceedings of the IEEE International Conference on Systems, 2011

A transformation algorithm for optimal admissible generalized mutual exclusion constraints on Petri nets with uncontrollable transitions.
Proceedings of the IEEE International Conference on Robotics and Automation, 2011

Extracting all minimal siphons from maximal unmarked siphons in manufacturing-oriented Petri nets.
Proceedings of the IEEE Conference on Automation Science and Engineering, 2011

Necessary and sufficient conditions for resultant siphons to be controlled.
Proceedings of the American Control Conference, 2011

2010
An algorithm to find the condition on initial markings of resource places and job places for liveness of S3PMR.
Proceedings of the 8th IEEE International Conference on Control and Automation, 2010

A method of computing strict minimal siphons in an S<sup>3</sup>PR based on resource circuits.
Proceedings of the 49th IEEE Conference on Decision and Control, 2010


  Loading...