Summary
International Technical Conference on Circuits/Systems, Computers and Communications
2016
Session Number:M2-1
Session:
Number:M2-1-1
Enumerating Minimal Siphons of Petri Net using SAT Solver
Tan Lam Pham, Atsushi Ohta, Kohkichi Tsuji ,
pp.117-120
Publication Date:2016/7/10
Online ISSN:2188-5079
Summary:
In this paper, we study a method to enumerate all minimal siphons of Petri net. Conventional algorithm is based on Fourier-Motzkin method and if it fails because of memory shortage, no siphon is obtained. We suggest a successive enumeration algorithm using SAT solver. The solver can yield one solution to the logic equation for siphon. Then it is augmented clauses that exclude siphons that have been obtained. Computer experiment is done to show effectiveness of our method.