Loading...
Please wait, while we are loading the content...
Similar Documents
Deterministic A-free Petri net Languages and their Application to the Supervisory Control of Discrete Event Dynamic Systems
| Content Provider | Semantic Scholar |
|---|---|
| Author | Sreenivas, Systems Ramavarapu S. |
| Copyright Year | 1993 |
| Abstract | In this paper we introduce a family of languages called Deterministic A-free Petri net languages (DPNLs) [5]. We show that the controllability of a DPNL K C* with respect to a DPNL L C C* is decidable. That is, it is possible to decide if (i) K C L, and (ii) KC, n L C K, where C = C, U C, and C, n C, = 8. We also show that this family of languages strictly includes the family of Free-labeled Petri net languages (FLPNLs), another family of languages where the controllability of one language with respect to another is decidable [9]. Essentially this paper is an extension of reference |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://deds.csl.uiuc.edu/midwest.ps.Z |
| Alternate Webpage(s) | http://rsree.ise.illinois.edu/DEDS_Systems_files/MCSC93.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
