DocumentCode
301469
Title
Linear algebra based verification of well-behavedness of knitting technique
Author
Chao, Daniel Y. ; Wang, DavidT
Author_Institution
Dept. of Manage. Inf. Syst., Nat. Cheng Chi Univ., Taipei, Taiwan
Volume
2
fYear
1995
fDate
22-25 Oct 1995
Firstpage
1448
Abstract
This work proves that the ordinary Petri nets synthesized with knitting technique are structurally bounded, consistent, conservative and safe (when each home place holds one token) using the well-known linear algebra approach. It also provides a procedure for finding P- and T-invariants for Petri net synthesized using the knitting technique. We also present examples for P-invariants
Keywords
Petri nets; invariance; linear algebra; Petri net synthesis; invariants; knitting technique; linear algebra; structural boundedness; structural liveness; Chaos; Error correction; Home computing; Information science; Linear algebra; Management information systems; Petri nets; Terminology;
fLanguage
English
Publisher
ieee
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
Type
conf
DOI
10.1109/ICSMC.1995.537976
Filename
537976
Link To Document