Characterization of minimal and basis siphons with predicate logic and binary programming
暂无分享,去创建一个
[1] Erwin R. Boer,et al. Generating basis siphons and traps of Petri nets using the sign incidence matrix , 1994 .
[2] Kamel Barkaoui,et al. Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems , 1990, Discret. Appl. Math..
[3] Feng Chu,et al. Deadlock analysis of Petri nets using siphons and mathematical programming , 1997, IEEE Trans. Robotics Autom..
[4] MuDer Jeng,et al. Generating minimal siphons and traps for Petri nets , 1996, 1996 IEEE International Conference on Systems, Man and Cybernetics. Information Intelligence and Systems (Cat. No.96CH35929).
[5] Manuel Silva Suárez,et al. A New Technique for Finding a Generating Family of Siphons, Traps and st-Components. Application to Colored Petri Nets , 1991, Applications and Theory of Petri Nets.
[6] Tadao Murata,et al. Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.
[7] MuDer Jeng,et al. Petri nets liveness analysis by minimal siphons , 1997, 1997 IEEE 6th International Conference on Emerging Technologies and Factory Automation Proceedings, EFTA '97.
[8] Joaquín Ezpeleta,et al. A Petri net solution to the problem of deadlocks in systems of processes with resources , 1999, 1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467).
[9] K. Lautenback. Linear algebraic calculation of deadlocks and traps , 1987 .
[10] Wolfgang Reisig. Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.