IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Special Section on Mathematical Systems Science and its Applications
Verifying Structurally Weakly Persistent Net Is Co-NP Complete
Atsushi OHTAKohkichi TSUJI
Author information
JOURNALS RESTRICTED ACCESS

2011 Volume E94.A Issue 12 Pages 2832-2835

Details
Abstract

Petri net is a powerful modeling tool for concurrent systems. Subclasses of Petri net are suggested to model certain realistic applications with less computational cost. Structurally weakly persistent net (SWPN) is one of such subclasses where liveness is verified in deterministic polynomial time. This paper studies the computational complexity to verify whether a give net is SWPN. 3UNSAT problem is reduced to the problem to verify whether a net is not SWPN. This implies co-NP completeness of verification problem of SWPN.

Information related to the author
© 2011 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top