Characterization of minimal and basis siphons with predicate logic and binary programming
Tóm tắt
The paper addresses the problem of computing siphons and traps in a standard Petri net. In particular, starting from a clear formulation in terms of predicate logic, it is shown how binary programming techniques can be adopted to formulate and solve the problem of finding minimal and basis siphons. An experimental campaign on a large set of random test instances proves the effectiveness of the method when compared to a constructive one.
Từ khóa
#Logic programming #Petri nets #Iterative algorithms #Testing #Equations #Electronic mail #Communication system control #Flexible manufacturing systems #Logic functions #Functional programmingTài liệu tham khảo
10.1109/ETFA.1997.616289
10.1109/ICSMC.1996.561441
10.1109/5.24143
kinuyama, 1986, Generating siphons and traps by Petri net representation of logic equations, Proceedings of 2th Conference of the Net Theory SIG-IECE, 93
reisig, 1982, Petri Nets An Introduction
ezpeleta, 1991, A new technique for finding a generating family of siphons traps and st-components. Application to colored Petri nets, Proc of 12th Conference on Applications and Theory of Petri Nets, 126
10.1109/ETFA.1999.813106
10.1016/0166-218X(90)90144-2
10.1007/978-3-642-72822-8_21
10.1109/70.650158
moody, 0, Supervisory Control of Discrete Event Systems Using Petri nets Kluwer
10.1109/81.285680