On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation
type: Item
instance of: scholarly article
title: On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation
zbMATH Open document ID: 0654.93046
DOI: 10.1007/BF02551361
author: Hangju Cho
author: Steven I. Marcus
published in: MCSS. Mathematics of Control, Signals, and Systems
publication date: 1989-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 93C99
Mathematics Subject Classification ID: 68N25
Mathematics Subject Classification ID: 93B50
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 4068733
zbMATH Keywords: discrete-event systems
zbMATH Keywords: supervisor synthesis
zbMATH Keywords: partial observations
zbMATH Keywords: recognizable languages
zbMATH Keywords: automata
MaRDI profile type: Publication
cites work: Supervisory control of discrete-event processes with partial observations
cites work: Q3862379
cites work: On observability of discrete-event systems
cites work: Supervisory Control of a Class of Discrete Event Processes
cites work: Q3787870
cites work: Modular supervisory control of discrete-event systems
description: scientific article; zbMATH DE number 4068733