1995
DOI: 10.1007/bf01439153
|View full text |Cite
|
Sign up to set email alerts
|

On control of systems modelled as deterministic Rabin automata

Abstract: Abstract.Recent results on the control of infinite behaviour of finite automata are extended to allow Rabin acceptance conditions as modelling assumptions as well as specifications. The key result is a fixpoint characterization of the automaton's controllability subset--the set of states from which it can be controlled to the satisfaction of its associated specification. The fixpoint characterization allows for straightforward computation of the subset and for effective synthesis of controllers. The results ha… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
18
0

Year Published

1996
1996
2019
2019

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(18 citation statements)
references
References 33 publications
0
18
0
Order By: Relevance
“…Wen et al 2008;Paoli et al 2011;Moor 2016), and, most relevant for this report, behaviours over an infinite time-axis (e.g. Ramadge 1989a;Thistle andWonham 1994a, 2009;Moor et al 2011;Baier and Moor 2015;Zhang and Cai 2018).…”
Section: Introductionmentioning
confidence: 71%
See 2 more Smart Citations
“…Wen et al 2008;Paoli et al 2011;Moor 2016), and, most relevant for this report, behaviours over an infinite time-axis (e.g. Ramadge 1989a;Thistle andWonham 1994a, 2009;Moor et al 2011;Baier and Moor 2015;Zhang and Cai 2018).…”
Section: Introductionmentioning
confidence: 71%
“…This contrasts the design of reactive modules where the synthesis of liveness properties is conceived a relevant challenge. We therefore conduct our study for a branch of supervisory control that addresses the synthesis problem for ω-languages; (see Ramadge 1989a;Thistle andWonham 1994a, 1995), where the authors explicitly relate their work to Church's problem. For a comprehensive introduction to SCT for ω-languages see also the technical report by Moor (2017).…”
Section: Scopementioning
confidence: 99%
See 1 more Smart Citation
“…[13] proposed an alternative algorithm to compute the supremal ω-controllable sublanguage. Later, Thistle [14] extend the result in [10] to a more general case where the plant DES are modelled by deterministic Rabin-automata. More recently, Thistle and Lamouchi [15] addressed the issue of partial observation in the supervisory control of DES with infinite behavior.…”
Section: Introductionmentioning
confidence: 77%
“…Our proposed localization procedure can in principle be used to construct local controllers from supervisors computed by any other synthesis method for DES with infinite behavior e.g. [8,9,14].…”
Section: Introductionmentioning
confidence: 99%