Marking Estimation in Petri Nets Using Hierarchical Basis Reachability Graphs
Autor: | Zhiwu Li, Ziyue Ma, Guanghui Zhu |
---|---|
Rok vydání: | 2021 |
Předmět: |
0209 industrial biotechnology
Theoretical computer science Basis (linear algebra) Computer science Observable 02 engineering and technology Petri net Unobservable Partition (database) Graph Computer Science Applications Set (abstract data type) 020901 industrial engineering & automation Supervisory control Control and Systems Engineering Reachability Computer Science::Logic in Computer Science Electrical and Electronic Engineering Computer Science::Formal Languages and Automata Theory |
Zdroj: | IEEE Transactions on Automatic Control. 66:810-817 |
ISSN: | 2334-3303 0018-9286 |
Popis: | In this article, we propose a two-layer-structure called hierarchical basis reachability graph that is useful for marking estimation in Petri nets that contain unobservable transitions. On the basis of a hierarchical partition of the set of observable transitions, a hierarchical basis reachability graph consists of a primary and a secondary structures. Simulation shows that the time-consumption to compute a hierarchical basis reachability graph is in general much less than that of computing the corresponding basis reachability graph. A marking estimation algorithm is proposed by the structural analysis of the corresponding hierarchical basis reachability graph. |
Databáze: | OpenAIRE |
Externí odkaz: |