On detectability of labeled Petri nets and finite automata

02/21/2018
by   Kuize Zhang, et al.
0

Detectability is a basic property of dynamic systems: when it holds one can use the observed output signal produced by a system to reconstruct its current state. In this paper, we consider properties of this type in the framework of discrete event systems modeled by labeled Petri nets and finite automata. We first study weak approximate detectability. This property implies that there exists an evolution of the system such that each corresponding observed output sequence with length greater than a given value allows one to determine if the current state belongs to a given set. We show that the problem of verifying this property is undecidable for labeled Petri nets, and PSPACE-complete for finite automata. We also consider two new concepts called instant strong detectability and eventual strong detectability. The former property implies that for each possible evolution the corresponding observed output sequence allows one to reconstruct the current state. The latter implies that for each possible evolution, there exists a value such that each corresponding observed output sequence with length greater than than that value allows one to reconstruct the current state. We show that for labeled Petri nets, the problems of verifying these two properties are both decidable and EXPSPACE-hard; while for finite automata, both properties can be verified in polynomial time. In addition, we show that strong detectability in the literature is strictly stronger than eventual strong detectability, but strictly weaker than instant strong detectability, for both finite automata and labeled Petri nets. In particular for deterministic finite au- tomata, eventual strong detectability is equivalent to strong detectability.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

02/21/2018

On detectability of labeled Petri nets with inhibitor arcs

Detectability is a basic property of dynamic systems: when it holds one ...
02/06/2018

Deciding Detectability for Labeled Petri Nets

Detectability of discrete event systems (DESs) is a property to determin...
01/14/2020

A unified method to decentralized state inference and fault diagnosis/prediction of discrete-event systems

The state inference problem and fault diagnosis/prediction problem are f...
11/04/2021

Small model property reflects in games and automata

Small model property is an important property that implies decidability....
01/07/2020

VC-dimensions of nondeterministic finite automata for words of equal length

Ishigami and Tani studied VC-dimensions of deterministic finite automata...
11/03/2021

A unified concurrent-composition method to state/event inference and concealment in discrete-event systems

Discrete-event systems usually consist of discrete states and transition...
06/21/2018

Universal Safety for Timed Petri Nets is PSPACE-complete

A timed network consists of an arbitrary number of initially identical 1...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.