On observability of discrete-event systems
Information Sciences: an International Journal - Robotics and Automation/Control Series
Decentralized supervisory control of discrete-event systems
Information Sciences: an International Journal - Robotics and Automation/Control Series
Decentralized state feedback control of discrete event systems
Systems & Control Letters
SIAM Journal on Control and Optimization
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Supervisor synthesis for partially observed discrete-event systems
Supervisor synthesis for partially observed discrete-event systems
Modeling, analysis and control of centralized and decentralized logical discrete-event systems
Modeling, analysis and control of centralized and decentralized logical discrete-event systems
Knowledge and communication in decentralized discrete-event control
Knowledge and communication in decentralized discrete-event control
Introduction to Discrete Event Systems
Introduction to Discrete Event Systems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Brief paper: Formulae relating controllability, observability, and co-observability
Automatica (Journal of IFAC)
Control of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction
Discrete Event Dynamic Systems
Diagnosis of Discrete Event Systems Using Decentralized Architectures
Discrete Event Dynamic Systems
Trellis Processes: A Compact Representation for Runs of Concurrent Systems
Discrete Event Dynamic Systems
Partial Order Techniques for Distributed Discrete Event Systems: Why You Cannot Avoid Using Them
Discrete Event Dynamic Systems
Priority Scheduling of Distributed Systems Based on Model Checking
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
ISC '07 Proceedings of the 10th IASTED International Conference on Intelligent Systems and Control
ACC'09 Proceedings of the 2009 conference on American Control Conference
Multi-decision decentralized prognosis of failures in discrete event systems
ACC'09 Proceedings of the 2009 conference on American Control Conference
Supervisor direct synthesis method for a structured discrete dynamical system
Automation and Remote Control
Automatica (Journal of IFAC)
Knowledge based scheduling of distributed systems
Time for verification
Methods for knowledge based controlling of distributed systems
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
A summary of some discrete-event system control problems
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Decentralized Control of Infinite Systems
Discrete Event Dynamic Systems
Synthesis of distributed control through knowledge accumulation
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
The buck stops here: order, chance, and coordination in distributed control
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Priority scheduling of distributed systems based on model checking
Formal Methods in System Design
Supervisory control synthesis of discrete-event systems using a coordination scheme
Automatica (Journal of IFAC)
Achieving distributed control through model checking
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Achieving distributed control through model checking
Formal Methods in System Design
Application of supervisory control theory to theme park vehicles
Discrete Event Dynamic Systems
Centralised controller for manufacturing systems through liveness extraction approach
International Journal of Systems, Control and Communications
Hi-index | 0.02 |
We consider a generalized form of the conventional decentralized control architecture for discrete-event systems where the control actions of a set of supervisors can be “fused” using both union and intersection of enabled events. Namely, the supervisors agree a priori on choosing “fusion by union” for certain controllable events and “fusion by intersection” for certain other controllable events. We show that under this architecture, a larger class of languages can be achieved than before since a relaxed version of the notion of co-observability appears in the necessary and sufficient conditions for the existence of supervisors. The computational complexity of verifying these new conditions is studied. A method of partitioning the controllable events between “fusion by union” and “fusion by intersection” is presented. The algebraic properties of co-observability in the context of this architecture are presented. We show that appropriate combinations of fusion rules with corresponding decoupled local decision rules guarantee the safety of the closed-loop behavior with respect to a given specification that is not co-observable. We characterize an “optimal” combination of fusion rules among those combinations guaranteeing the safety of the closed-loop behavior. In addition, a simple supervisor synthesis technique generating the infimal prefix-closed controllable and co-observable superlanguage is presented.