Name
Abstract | ||
|---|---|---|
We show that the notion of uncontrollable marking commonly used in the literature on supervisory control theory of Petri nets is not sound, by means of a counter-example. We also show how the definition can be corrected and provide an adaptation of a decidability proof for the problem of checking controllability for specifications expressed as deterministic Petri net languages. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/TAC.2014.2320801 | IEEE Trans. Automat. Contr. |
Keywords | Field | DocType |
Controllability,Supervisory control,Petri nets,Feedback loop,Manganese,Synchronization,Frequency modulation | Synchronization,Petri net,Controllability,Control theory,Supervisory control,Supervisory control theory,Stochastic Petri net,Process architecture,Decidability,Mathematics | Journal |
Volume | Issue | ISSN |
59 | 11 | 0018-9286 |
Citations | PageRank | References |
1 | 0.36 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bruno Lacerda | 1 | 85 | 12.96 |
| Pedro U. Lima | 2 | 516 | 69.88 |