On the Notion of Uncontrollable Marking in Supervisory Control of Petri Nets

@article{Lacerda2014OnTN,
  title={On the Notion of Uncontrollable Marking in Supervisory Control of Petri Nets},
  author={Bruno Lacerda and Pedro U. Lima},
  journal={IEEE Transactions on Automatic Control},
  year={2014},
  volume={59},
  pages={3069-3074}
}
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. 

Figures and Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES

An algorithm for the general Petri net reachability problem

E. W. Mayr
  • SIAM J. Comp., vol. 13, no. 3, pp. 441–460, 1984.
  • 1984
VIEW 14 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…