4 Symbolic Computation of State Tree Structures
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,⋅).
Unable to display preview. Download preview PDF.