Back to Search
Start Over
A Polynomial-Time Algorithm to Obtain State Machine Cover of Live and Safe Petri Nets.
- Source :
- IEEE Transactions on Systems, Man & Cybernetics. Systems; Oct2020, Vol. 50 Issue 10, p3592-3597, 6p
- Publication Year :
- 2020
-
Abstract
- A method to find the minimized state machine cover of live and safe Petri nets (PNs) is proposed in this paper. It is required that a cover be obtained in some implementation methods of PN-based control algorithms and other applications such as data mining. Most of the known methods of its computation have at least exponential time and space complexity; this is true not only for the methods which guarantee a minimal cover is obtained but also for some methods of finding approximate solutions. The proposed algorithm is an approximation algorithm and has polynomial computational complexity. The experimental verification shows a very high efficiency of the presented technique. The proposed method is especially valuable in the case of large systems where a solution is obtained hundreds of times quicker than by other methods. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 21682216
- Volume :
- 50
- Issue :
- 10
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Systems, Man & Cybernetics. Systems
- Publication Type :
- Academic Journal
- Accession number :
- 146012237
- Full Text :
- https://doi.org/10.1109/TSMC.2019.2894778