Advertisement

4 Symbolic Computation of State Tree Structures

  • Chuan Ma
  • W. Murray Wonham
Chapter
Part of the Lecture Notes in Control and Information Science book series (LNCIS, volume 317)

Abstract

In the previous chapter, we developed a new algorithm for the nonblocking supervisory control of STS. The efficiency of this algorithm depends on the fast computation of [⋅] and CR (G,⋅). In this chapter, we will exploit the rich structure of our STS models and symbolically compute [⋅] and CR(G,⋅).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Authors and Affiliations

  • Chuan Ma
    • 1
  • W. Murray Wonham
    • 1
  1. 1.University of Toronto Dept. of Electrical and Computer Engineering 10 King’s College Road Toronto, OntarioCanada M5S 3G4

Personalised recommendations