## Abstract

If G is a plant automaton and K ⊃ L(G) is a prefix-closed language there exists a supervisor Θ that is complete with respect to G such that L(Θ|G) = K intersect L(G) = K if and only if K is controllable with respect to the plant language L(G) (ef.). The language K is said to controllable with respect to L(G) if and only if i) K ⊃ L, and ii) KΣ_{u} intersect L(G) ⊃ K, where Σ = Σ_{u} union Σ_{c} and Σ_{u} intersect Σ_{c} = O. The issue of deciding the controllability of K with respect to L(G) has been well studied in the context of finite-state automata. Attempts at studying the above problem in a broader context have all concluded that it is undecidable. In this note, we show that if L(G) and K are represented as free-labeled Petri nets (cf.) then the controllability of K with respect to L(G) is decidable. This result is a direct consequence of the decidability of the Petri net reachability problem. In effect, we have identified a modeling framework capable of finitely representing a class of infinite state systems and controllability is decidable within this framework.

Original language | English (US) |
---|---|

Pages (from-to) | 658-662 |

Number of pages | 5 |

Journal | IEEE Transactions on Automatic Control |

Volume | 38 |

Issue number | 4 |

DOIs | |

State | Published - Apr 1993 |

Externally published | Yes |

## ASJC Scopus subject areas

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