Weak (approximate) detectability of a labeled Petri net (LPN) system (with inhibitor arcs) is a property such that if the property is satisfied then there exists an infinite label sequence generated by the system such that all markings after a time step can determined (in a prescribed subset of reachable markings) by the label sequence. Specifically, we prove that the problems of deciding weak detectability of LPN systems with inhibitor arcs and weak approximate detectability of LPN systems are both undecidable.

Weak (approximate) detectability of labeled Petri net systems with inhibitor arcs

Giua, Alessandro
Ultimo
2018-01-01

Abstract

Weak (approximate) detectability of a labeled Petri net (LPN) system (with inhibitor arcs) is a property such that if the property is satisfied then there exists an infinite label sequence generated by the system such that all markings after a time step can determined (in a prescribed subset of reachable markings) by the label sequence. Specifically, we prove that the problems of deciding weak detectability of LPN systems with inhibitor arcs and weak approximate detectability of LPN systems are both undecidable.
2018
decidability; Petri net with inhibitor arcs; weak approximate detectability; weak detectability; Control and Systems Engineering
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11584/250436
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 10
  • ???jsp.display-item.citation.isi??? 9
social impact