On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation (Q1108988): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:13, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation |
scientific article |
Statements
On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation (English)
0 references
1989
0 references
This paper characterizes the class of closed and (M,N)-recognizable languages in terms of certain structural aspects of relevant automata. This characterization leads to algorithms that effectively compute the supremal (M,N)-recognizable sublanguage of a given language. One of these algorithms is used, in an alternating manner with an algorithm which yields the supremal \((\Sigma_ u,N)\)-invariant sublanguage, to compute the supremal sublanguage of a given language that is both \((\Sigma_ u,N)\)-invariant and (M,N)-recognizable. Finite convergence of the resulting algorithm is proved. An example illustrates the use of these algorithms.
0 references
discrete-event systems
0 references
supervisor synthesis
0 references
partial observations
0 references
recognizable languages
0 references
automata
0 references