A note on the properties of the supremal controllable sublanguage in pushdown systems

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

Consider an event alphabet Σ. The supervisory control theory of Ramadge and Wonham asks the question: given a plant model G with language LM(G) ⊆ Σ* and another language K ⊆ LM( G), is there a supervisor such that LM (/G) = K? Ramadge and Wonham showed that a necessary condition for this to be true is the so-called controllability of with respect to Lm (G). They showed that when G is a finite-state automaton and K is a regular language (also generated by a finite state automaton), then there is a regular supremal controllable sublanguageC ⊆ (K) that is effectively constructable from generators of K and G. In this paper, we show: 1) there is an algorithm to compute the supremal controllable sublanguage of a prefix closed K accepted by a deterministic pushdown automaton (DPDA) when the plant language is also prefix closed and accepted by a finite state automaton and 2) in this case, we show that this supremal controllable sublanguage is also accepted by a DPDA.

Original languageEnglish (US)
Pages (from-to)826-829
Number of pages4
JournalIEEE Transactions on Automatic Control
Volume53
Issue number3
DOIs
StatePublished - Apr 1 2008

Fingerprint

Finite automata
Formal languages
Supervisory personnel
Controllability
Control theory

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

@article{03e6fb4700be4ed08492db4cfe96b7a2,
title = "A note on the properties of the supremal controllable sublanguage in pushdown systems",
abstract = "Consider an event alphabet Σ. The supervisory control theory of Ramadge and Wonham asks the question: given a plant model G with language LM(G) ⊆ Σ* and another language K ⊆ LM( G), is there a supervisor such that LM (/G) = K? Ramadge and Wonham showed that a necessary condition for this to be true is the so-called controllability of with respect to Lm (G). They showed that when G is a finite-state automaton and K is a regular language (also generated by a finite state automaton), then there is a regular supremal controllable sublanguageC ⊆ (K) that is effectively constructable from generators of K and G. In this paper, we show: 1) there is an algorithm to compute the supremal controllable sublanguage of a prefix closed K accepted by a deterministic pushdown automaton (DPDA) when the plant language is also prefix closed and accepted by a finite state automaton and 2) in this case, we show that this supremal controllable sublanguage is also accepted by a DPDA.",
author = "Christopher Griffin",
year = "2008",
month = "4",
day = "1",
doi = "10.1109/TAC.2008.919519",
language = "English (US)",
volume = "53",
pages = "826--829",
journal = "IEEE Transactions on Automatic Control",
issn = "0018-9286",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

A note on the properties of the supremal controllable sublanguage in pushdown systems. / Griffin, Christopher.

In: IEEE Transactions on Automatic Control, Vol. 53, No. 3, 01.04.2008, p. 826-829.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A note on the properties of the supremal controllable sublanguage in pushdown systems

AU - Griffin, Christopher

PY - 2008/4/1

Y1 - 2008/4/1

N2 - Consider an event alphabet Σ. The supervisory control theory of Ramadge and Wonham asks the question: given a plant model G with language LM(G) ⊆ Σ* and another language K ⊆ LM( G), is there a supervisor such that LM (/G) = K? Ramadge and Wonham showed that a necessary condition for this to be true is the so-called controllability of with respect to Lm (G). They showed that when G is a finite-state automaton and K is a regular language (also generated by a finite state automaton), then there is a regular supremal controllable sublanguageC ⊆ (K) that is effectively constructable from generators of K and G. In this paper, we show: 1) there is an algorithm to compute the supremal controllable sublanguage of a prefix closed K accepted by a deterministic pushdown automaton (DPDA) when the plant language is also prefix closed and accepted by a finite state automaton and 2) in this case, we show that this supremal controllable sublanguage is also accepted by a DPDA.

AB - Consider an event alphabet Σ. The supervisory control theory of Ramadge and Wonham asks the question: given a plant model G with language LM(G) ⊆ Σ* and another language K ⊆ LM( G), is there a supervisor such that LM (/G) = K? Ramadge and Wonham showed that a necessary condition for this to be true is the so-called controllability of with respect to Lm (G). They showed that when G is a finite-state automaton and K is a regular language (also generated by a finite state automaton), then there is a regular supremal controllable sublanguageC ⊆ (K) that is effectively constructable from generators of K and G. In this paper, we show: 1) there is an algorithm to compute the supremal controllable sublanguage of a prefix closed K accepted by a deterministic pushdown automaton (DPDA) when the plant language is also prefix closed and accepted by a finite state automaton and 2) in this case, we show that this supremal controllable sublanguage is also accepted by a DPDA.

UR - http://www.scopus.com/inward/record.url?scp=42649125282&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=42649125282&partnerID=8YFLogxK

U2 - 10.1109/TAC.2008.919519

DO - 10.1109/TAC.2008.919519

M3 - Article

AN - SCOPUS:42649125282

VL - 53

SP - 826

EP - 829

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

SN - 0018-9286

IS - 3

ER -