Existence and Uniqueness of a Minimum Crisp Boolean Petri Net
Gajendra PratapSingh, Sangita Kansal, Mukti Acharya · International Journal of Computer Applications · 2013
In the continuing research towards characterizing 1-safe Petri nets with n-places and generating all the 2 n binary n-vectors as marking vectors exactly once, the problem of determine minimum Petri nets; 'minimum' in the sense that the number of transitions is kept minimum possible for the generation of all the 2 n binary n-vectors has been found.In this paper, the existence and uniqueness of a minimum Petri net which generates all the 2 n binary n-vectors exactly once has been shown.For brevity, a 1-safe Petri net that generate all the binary n-vectors as marking vectors is called a Boolean Petri net and a 1-safe Petri net that generates all the binary n-vectors exactly once is called crisp Boolean Petri net.