IEEE Transactions on Automatic Control · 2005 · 111 citations · 41 references
EngineeringComputer EngineeringComputer ScienceManufacturing SystemsParallel ComputingSystems ModelingControl SystemsDiscrete-event System ModelingHierarchical DesignInterprocess CommunicationModel CheckingSupervisory ControlComputational Complexity Of DecompositionDiscrete-event ModelingInterface ConsistencySubsystem InteractionsSupervisory Control InterfacesSupervisory Control SystemsSupervisory Control TheorySystem Model Definition
In this paper, we present a hierarchical method that decomposes a discrete-event system (DES) into a high-level subsystem which communicates with n/spl ges/1 parallel low-level subsystems, through separate interfaces which restrict the interaction of the subsystems. It is a generalization of the serial case (n=1) described in Part I of this paper, where we define an interface and a set of interface consistency properties that can be used to verify if a DES is nonblocking and controllable. Each clause of the definition can be verified using a single subsystem; thus the complete system model never needs to be stored in memory, offering potentially significant savings in computational resources. We provide algorithms for verifying these new properties, and briefly discuss the computational complexity of the method. Finally, we present an application to a large manufacturing example with an estimated worst-case closed-loop state-space size of 2.9/spl times/10/sup 21/.
41
Graph-Based Algorithms for Boolean Function Manipulation
Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text
Symbolic model checking: 1020 States and beyond
Jerry R. Burch, E. M. Clarke, Kenneth L. McMillan et al. · Information and Computation · 1992 · 2.7K citations