On the notion of uncontrollable marking in supervisory control of petri nets

Research output: Contribution to journalArticle

Authors

Colleges, School and Institutes

External organisations

  • Universidade de Lisboa
  • Institute for Systems and Robotics, Instituto Superior Técnico, Universidade de Lisboa

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.

Details

Original languageEnglish
Article number6807731
Pages (from-to)3069-3074
Number of pages6
JournalIEEE Transactions on Automatic Control
Volume59
Issue number11
Publication statusPublished - 1 Nov 2014

Keywords

  • Controllability, discrete event systems (DES), Petri nets (PNs), supervisory control