Title :
Synchronized choice ordinary Petri net
Author :
Chao, Daniel Y. ; Wang, David T.
Author_Institution :
Dept. of Manage. Inf. Syst., Nat. Cheng Chi Univ., Taepei, Taiwan
Abstract :
We present a new class of Petri nets, called synchronized choice nets, which are the largest set of Petri nets that can be covered by both T-components and P-components. An algorithm is proposed to find its T-components and the P-components, respectively. The complexity of these algorithm is also presented. The theory of synchronized choice nets has the potential to simplify that for free choice nets
Keywords :
Petri nets; computational complexity; P-components; Petri nets; T-components; computational complexity; polynomial time; synchronized choice nets; synchronizing cycles; Bridge circuits; Chaos; Circuit synthesis; Gold; Information science; Management information systems; Petri nets; Sufficient conditions; System recovery; Tellurium;
Conference_Titel :
Systems, Man and Cybernetics, 1995. Intelligent Systems for the 21st Century., IEEE International Conference on
Conference_Location :
Vancouver, BC
Print_ISBN :
0-7803-2559-1
DOI :
10.1109/ICSMC.1995.537975
