Add to ORKGWe present a new algorithm to verify inference observability in supervisory control of decentralized discreteevent systems. The algorithm's success relies on the following idea. An inferencing solution exists only when a language does not contain any inferencing cycles
Most discrete event system models are based on defining the alphabet set or the set of events as a f...
There exists a class of decentralized discrete-event control problems where a control solution could...
We consider a generalized form of the conventional decentralized control architecture for discrete-e...
Abstract — Existing strategies for verifying co-observability, one of the properties that must be sa...
Existing strategies for verifying co-observability, one of the properties that must be satisfied for...
Centralized and decentralized monitoring and control of discrete-event systems under partial observa...
Existing strategies for verifying co-observability, one of the properties that must be satisfied for...
In this paper we deal with the problem of decentralized observability of discrete event systems. We ...
In earlier papers [3, 2, 1] we introduced the formalism of probabilistic languages for modeling the ...
In this paper we deal with the problem of decentralized observability of discrete event systems. We ...
This thesis explores computational issues related to the control and verification of systems with di...
We propose a new framework for supervisory control design for discrete event systems. Some of the fe...
We study supervisory control of timed discrete-event systems (TDES) under partial observation, and p...
The observer property is an important condition to be satisfied by abstractions of Discrete Event Sy...
In this paper we extend the theory of supervisory control of nondeterministic discrete-event systems...
Most discrete event system models are based on defining the alphabet set or the set of events as a f...
There exists a class of decentralized discrete-event control problems where a control solution could...
We consider a generalized form of the conventional decentralized control architecture for discrete-e...
Abstract — Existing strategies for verifying co-observability, one of the properties that must be sa...
Existing strategies for verifying co-observability, one of the properties that must be satisfied for...
Centralized and decentralized monitoring and control of discrete-event systems under partial observa...
Existing strategies for verifying co-observability, one of the properties that must be satisfied for...
In this paper we deal with the problem of decentralized observability of discrete event systems. We ...
In earlier papers [3, 2, 1] we introduced the formalism of probabilistic languages for modeling the ...
In this paper we deal with the problem of decentralized observability of discrete event systems. We ...
This thesis explores computational issues related to the control and verification of systems with di...
We propose a new framework for supervisory control design for discrete event systems. Some of the fe...
We study supervisory control of timed discrete-event systems (TDES) under partial observation, and p...
The observer property is an important condition to be satisfied by abstractions of Discrete Event Sy...
In this paper we extend the theory of supervisory control of nondeterministic discrete-event systems...
Most discrete event system models are based on defining the alphabet set or the set of events as a f...
There exists a class of decentralized discrete-event control problems where a control solution could...
We consider a generalized form of the conventional decentralized control architecture for discrete-e...