Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem
From MaRDI portal
Publication:5282361
DOI10.1109/TAC.2016.2574120zbMath1366.93357MaRDI QIDQ5282361
Zhiwu Li, Yin Tong, Alessandro Giua, Ziyue Ma
Publication date: 27 July 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Controllability (93B05) Discrete event control/observation systems (93C65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Attainable sets, reachability (93B03)
Related Items (12)
Verification of \(K\)-step and infinite-step opacity of bounded labeled Petri nets ⋮ Petri net controllers for generalized mutual exclusion constraints with floor operators ⋮ Marking diagnosability verification in labeled Petri nets ⋮ Diagnosability enforcement in labeled Petri nets using supervisory control ⋮ Secret inference and attacktability analysis of discrete event systems ⋮ Deadlock analysis and control using Petri net decomposition techniques ⋮ Verification of C-detectability using Petri nets ⋮ Decentralized state estimation and diagnosis of p-time labeled Petri nets systems ⋮ Analysis of strong and strong periodic detectability of bounded labeled Petri nets ⋮ Design of supervisors for linear marking specifications in labeled Petri nets ⋮ Verification and enforcement of strong infinite- and \(k\)-step opacity using state recognizers ⋮ Deadlock and liveness characterization for a class of generalized Petri nets
This page was built for publication: Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem
