A note on deciding controllability in pushdown systems

Research output: Contribution to journalArticle

9 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 the controllability property was decidable for K. The class of languages generated by pushdown automata properly includes the regular languages. They are accepted by finite state machines coupled with pushdown stack memory. This makes them interesting candidates as supervisory languages, since the supervisor will have nonfinite memory. In this note, we show the following: i) If S is a specification given by a deterministic pushdown automaton and L is generated by a finite state machine, then there is an algorithm to decide whether K = S ∩ L is controllable with respect to L. ii) It is undecidable for an arbitrary specification S generated by a nondeterministic pushdown automaton and plant language L generated by a finite state machine whether K= S ∩ L is controllable with respect to L.

Original languageEnglish (US)
Pages (from-to)334-337
Number of pages4
JournalIEEE Transactions on Automatic Control
Volume51
Issue number2
DOIs
StatePublished - Feb 1 2006

Fingerprint

Finite automata
Controllability
Formal languages
Supervisory personnel
Specifications
Data storage equipment
Control theory

All Science Journal Classification (ASJC) codes

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

Cite this

@article{274485d062184285966be1a905757f10,
title = "A note on deciding controllability 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 the controllability property was decidable for K. The class of languages generated by pushdown automata properly includes the regular languages. They are accepted by finite state machines coupled with pushdown stack memory. This makes them interesting candidates as supervisory languages, since the supervisor will have nonfinite memory. In this note, we show the following: i) If S is a specification given by a deterministic pushdown automaton and L is generated by a finite state machine, then there is an algorithm to decide whether K = S ∩ L is controllable with respect to L. ii) It is undecidable for an arbitrary specification S generated by a nondeterministic pushdown automaton and plant language L generated by a finite state machine whether K= S ∩ L is controllable with respect to L.",
author = "Christopher Griffin",
year = "2006",
month = "2",
day = "1",
doi = "10.1109/TAC.2005.863513",
language = "English (US)",
volume = "51",
pages = "334--337",
journal = "IEEE Transactions on Automatic Control",
issn = "0018-9286",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

A note on deciding controllability in pushdown systems. / Griffin, Christopher.

In: IEEE Transactions on Automatic Control, Vol. 51, No. 2, 01.02.2006, p. 334-337.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A note on deciding controllability in pushdown systems

AU - Griffin, Christopher

PY - 2006/2/1

Y1 - 2006/2/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 the controllability property was decidable for K. The class of languages generated by pushdown automata properly includes the regular languages. They are accepted by finite state machines coupled with pushdown stack memory. This makes them interesting candidates as supervisory languages, since the supervisor will have nonfinite memory. In this note, we show the following: i) If S is a specification given by a deterministic pushdown automaton and L is generated by a finite state machine, then there is an algorithm to decide whether K = S ∩ L is controllable with respect to L. ii) It is undecidable for an arbitrary specification S generated by a nondeterministic pushdown automaton and plant language L generated by a finite state machine whether K= S ∩ L is controllable with respect to L.

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 the controllability property was decidable for K. The class of languages generated by pushdown automata properly includes the regular languages. They are accepted by finite state machines coupled with pushdown stack memory. This makes them interesting candidates as supervisory languages, since the supervisor will have nonfinite memory. In this note, we show the following: i) If S is a specification given by a deterministic pushdown automaton and L is generated by a finite state machine, then there is an algorithm to decide whether K = S ∩ L is controllable with respect to L. ii) It is undecidable for an arbitrary specification S generated by a nondeterministic pushdown automaton and plant language L generated by a finite state machine whether K= S ∩ L is controllable with respect to L.

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

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

U2 - 10.1109/TAC.2005.863513

DO - 10.1109/TAC.2005.863513

M3 - Article

AN - SCOPUS:33244479694

VL - 51

SP - 334

EP - 337

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

SN - 0018-9286

IS - 2

ER -