A technique for generating the reduced reachability graph of petri net models
暂无分享,去创建一个
[1] Kimmo Varpaaniemi,et al. Stubborn Sets for Priority Nets , 2004, ISCIS.
[2] James Lyle Peterson,et al. Petri net theory and the modeling of systems , 1981 .
[3] Andrei Karatkevich,et al. Dynamic analysis of Petri net-based discrete systems , 2007 .
[4] Edmund M. Clarke,et al. State space reduction using partial order techniques , 1999, International Journal on Software Tools for Technology Transfer.
[5] Kimmo Varpaaniemi. On Stubborn Sets in the Verification of Linear Time Temporal Properties , 1998, ICATPN.
[6] Hejiao Huang. Enhancing the property-preserving petri net process algebra for component-based system design (with application to designing multi-agent systems and manufacturing systems) , 2004 .
[7] Jiantao Zhou,et al. On reachability graphs of Petri nets , 2003, Comput. Electr. Eng..
[8] Kimmo Varpaaniemi,et al. On Combining the Stubborn Set Method with the Sleep Set Method , 1994, Application and Theory of Petri Nets.
[9] Maciej Koutny,et al. Optimal simulations, nets and reachability graphs , 1990, Applications and Theory of Petri Nets.
[10] Philippe Schnoebelen,et al. The State Explosion Problem from Trace to Bisimulation Equivalence , 2000, FoSSaCS.
[11] Tadao Murata,et al. Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.
[12] Patrice Godefroid,et al. Partial-Order Methods for the Verification of Concurrent Systems , 1996, Lecture Notes in Computer Science.