Modeling, reachability and controllability of bounded Petri nets based on semi-tensor product of matrices

DOI10.1002/asjc.1915MaRDI QIDQ6563357

Xiao-Guang Han, Zhongxin Liu, Zeng-Qiang Chen, Qing Zhang, Kuize Zhang

Publication date: 27 June 2024

Published in: Asian Journal of Control (Search for Journal in Brave)

zbMATH Keywords

controllabilityreachabilitysemi-tensor product (STP) of matricesPetri nets (PNs)marking evolution equation (MEE)

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Design of a maximally permissive liveness-enforcing supervisor with a compressed supervisory structure for flexible manufacturing systems
• Input-state incidence matrix of Boolean control networks and its applications
• Mathematical programming approach to the Petri nets reachability problem
• Semi-tensor product of matrices and its application to Morgen's problem
• Controllability and observability of Boolean control networks
• Parallel program schemata
• A Semi-Tensor Product Approach to Pseudo-Boolean Functions with Application to Boolean Control Networks
• STP Approach to Model Controlled Automata with Application to Reachability Analysis of DEDS
• Introduction to Discrete Event Systems
• State equation, controllability, and maximal matchings of petri nets
• Hierarchical reachability graph of bounded Petri nets for concurrent-software analysis
• Matrix Approach to Model Matching of Asynchronous Sequential Machines

Related Items (4)

Regulation of game result for \(n\)-person random evolutionary Boolean games ⋮ Security and privacy with opacity-based state observation for finite state machine ⋮ A new look at the critical observability of finite state machines from an algebraic viewpoint ⋮ Opacity of discrete-event systems under nondeterministic observation mechanism

This page was built for publication: Modeling, reachability and controllability of bounded Petri nets based on semi-tensor product of matrices