Supervisory Control of Labeled Transition Systems Subject to Multiple Reachability Requirements via Symbolic Model Checking

We present an algorithm to compute the unique maximally permissive state-based supervisor for any deterministic finite labeled transition system subject to a specification with combined invariance and reachability requirements. The specifications that we consider are expressed in computation tree lo...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on control systems technology Ročník 28; číslo 2; s. 644 - 652
Hlavní autori:	Rawlings, Blake C., Lafortune, Stephane, Ydstie, B. Erik
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.03.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Chemical industry Chemicals Discrete-event systems Formal languages Model checking open-source software Organic chemistry Safety Specifications Supervisory control
ISSN:	1063-6536, 1558-0865
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!