论文信息 - Embedding an Arbitrary 1-safe Petri Net into a Boolean Petri Net

Embedding an Arbitrary 1-safe Petri Net into a Boolean Petri Net

Petri nets are powerful mathematical formalism for designing and studying behaviors of a wide range of discrete dynamical event driven systems. The aim of this paper is to show that an arbitrary1safe Petri net can be embedded as an induced subnet of a Boolean Petri net, viz., the one that generates every binary n-vector as its marking vector.

Gajendra Pratap Singh | Mukti Acharya | Sangita Kansal

[1] Frank Harary,et al. Graph Theory , 2016 .

[2] Kurt Jensen. Coloured Petri Nets , 1992, EATCS Monographs in Theoretical Computer Science.

[3] C. Petri. Kommunikation mit Automaten , 1962 .

[4] Dietmar Tutsch,et al. A Petri Net-Based Approach to the Quantification of Data Center Dependability , 2012 .

[5] G. Singh,et al. A Disconnected 1-Safe Petri Net Whose Reachability Tree Is Homomorphic to a Complete Boolean Lattice , 2011, 2011 International Conference on Process Automation, Control and Computing.

[6] Peter Radford,et al. Petri Net Theory and the Modeling of Systems , 1982 .

[7] Mukti Acharya,et al. ON PETRI NETS GENERATING ALL THE BINARY n-VECTORS , 2010 .

[8] James L. Peterson,et al. Petri Nets , 1977, CSUR.

[9] Marco Furini,et al. International Journal of Computer and Applications , 2010 .

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

[11] Jin S. Lee,et al. Generalized state equation of Petri Nets with priority , 2003, Int. J. Intell. Syst..

[12] Han Zandong,et al. Reachability Criterion with Sufficient Test Space for Ordinary Petri Net , 2012 .

[13] Gairatzhan Mavlankulov,et al. Grammars Controlled by Petri Nets , 2012 .