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

Bruno Lacerda; Pedro U. Lima

doi:10.1109/TAC.2014.2320801

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

Bruno Lacerda^*, Pedro U. Lima

^*Corresponding author for this work

Computer Science

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

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.

Original language	English
Article number	6807731
Pages (from-to)	3069-3074
Number of pages	6
Journal	IEEE Transactions on Automatic Control
Volume	59
Issue number	11
DOIs	https://doi.org/10.1109/TAC.2014.2320801
Publication status	Published - 1 Nov 2014

Keywords

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

ASJC Scopus subject areas

Electrical and Electronic Engineering
Control and Systems Engineering
Computer Science Applications

Access to Document

10.1109/TAC.2014.2320801

Cite this

@article{22e732eb5a3e4dda9410388b04bd07a3,

title = "On the notion of uncontrollable marking in supervisory control of petri nets",

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.",

keywords = "Controllability, discrete event systems (DES), Petri nets (PNs), supervisory control",

author = "Bruno Lacerda and Lima, {Pedro U.}",

year = "2014",

month = nov,

day = "1",

doi = "10.1109/TAC.2014.2320801",

language = "English",

volume = "59",

pages = "3069--3074",

journal = "IEEE Transactions on Automatic Control",

issn = "0018-9286",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

number = "11",

}

TY - JOUR

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

AU - Lacerda, Bruno

AU - Lima, Pedro U.

PY - 2014/11/1

Y1 - 2014/11/1

N2 - 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.

AB - 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.

KW - Controllability

KW - discrete event systems (DES)

KW - Petri nets (PNs)

KW - supervisory control

UR - http://www.scopus.com/inward/record.url?scp=84908403274&partnerID=8YFLogxK

U2 - 10.1109/TAC.2014.2320801

DO - 10.1109/TAC.2014.2320801

M3 - Article

AN - SCOPUS:84908403274

SN - 0018-9286

VL - 59

SP - 3069

EP - 3074

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

IS - 11

M1 - 6807731

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this