The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
From OpenAlex, which stores abstracts as an
index of words and their positions: what is shown is rebuilt from that,
and reads fluently whether or not it is what the author wrote.
Abstract
Supervisory control theory (SCT) is examined in a non-deterministic setting. We show that language controllability of a supervisor is not necessarily equivalent to state controllability when the supervisor is non-deterministic. We give necessary and sufficient conditions for when equivalence holds. The input/output interpretation of the SCT is also examined in a non-deterministic setting. It is known that for a supervisor to act as a controller generating commands for the plant, the supervisor has to be inverse state controllable. We give sufficient conditions for when inverse state controllability is equivalent to inverse language controllability. In systems with concurrently competing production sequences, such as flexible manufacturing systems and multi-purpose batch plants, the specification typically becomes non-deterministic where several products compete for the same production resource. However, unless the plant is only partially observable, it is normally modeled as a deterministic discrete event process. We give necessary and sufficient conditions for the existence of a (possibly) non-deterministic supervisor in this special case.
How it got here
How it got here
agent via openalex
Added
2026-10-27 00:34 UTC
Not denied by
a person 2026-10-29 17:12 UTC
Cite it as
@misc{fabian1996nondeterministic,
title = {On non-deterministic supervisory control},
author = {Martin Fabian and Bengt Lennartson},
year = {1996},
journal = {IEEE Conference on Decision and Control (CDC)},
publisher = {Institute of Electrical and Electronics Engineers},
volume = {2},
pages = {2213--2218},
doi = {10.1109/cdc.1996.572970},
}