|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 84 - Issue 16 |
| Published: December 2013 |
| Authors: Gajendra Pratap Singh |
10.5120/14657-2946
|
Gajendra Pratap Singh . A Wheel 1-Safe Petri Net Generating all the {0; 1}^n Sequences. International Journal of Computer Applications. 84, 16 (December 2013), 1-7. DOI=10.5120/14657-2946
@article{ 10.5120/14657-2946,
author = { Gajendra Pratap Singh },
title = { A Wheel 1-Safe Petri Net Generating all the {0; 1}^n Sequences },
journal = { International Journal of Computer Applications },
year = { 2013 },
volume = { 84 },
number = { 16 },
pages = { 1-7 },
doi = { 10.5120/14657-2946 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2013
%A Gajendra Pratap Singh
%T A Wheel 1-Safe Petri Net Generating all the {0; 1}^n Sequences%T
%J International Journal of Computer Applications
%V 84
%N 16
%P 1-7
%R 10.5120/14657-2946
%I Foundation of Computer Science (FCS), NY, USA
Petri nets are a graphic and mathematic modeling tool which is applicable to several systems and to all those systems presenting particular characteristics such as concurrency, distribution, parallelism, non-determinism and/or stochastically. In this paper, a wheel Petri net whose reachability tree contains all the binary n- tuples or sequences as marking vectors has been defined. The result is proved by the using of the Principle of Mathematical Induction (PMI) on jPj = n.