论文信息 - Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets - 字舞流文

Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets

Philippe Darondeau

[1] Jean-Marie Proth,et al. Petri nets : a tool for design and management of manufacturing systems , 1996 .

[2] Philippe Darondeau,et al. Polynomial Algorithms for the Synthesis of Bounded Nets , 1995, TAPSOFT.

[3] Ernst W. Mayr. Persistence of vector replacement systems is decidable , 2004, Acta Informatica.

[4] Edward L. Robertson,et al. Properties of Conflict-Free and Persistent Petri Nets , 1978, JACM.

[5] Eugene W. Stark,et al. Concurrent Transition Systems , 1989, Theor. Comput. Sci..

[6] Jan Grabowski,et al. The Decidability of Persistence for Vector Addition Systems , 1980, Information Processing Letters.

[7] Tadao Murata,et al. Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[8] Javier Esparza,et al. Model Checking of Persistent Petri Nets , 1991, CSL.