Liveness for synchronized choice Petri nets

Computer Journal

Volumn 44, Issue 2, 2001, Pages 124-136

  Chao, Daniel Y ^a   Nicdao, Jose A ^b  

^a NATIONAL CHENGCHI UNIVERSITY   (Taiwan)

^b INSTITUTE FOR INFORMATION INDUSTRY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

POLYNOMIAL TIME ALGORITHM; SYNCHRONIZED CHOICE PETRI NETS;

PETRI NETS;

EID: 0035653174     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/44.2.124     Document Type: Article

References (16)

1. Petri nets: Properties, analysis and applications
2. Circuits, handles, bridges, and nets
3. Two theoretical and practical aspects of knitting technique-Invariants and a new class of Petri net
4. Some properties of synchronized choice ordinary Petri net. Invited Session paper
5. Application of a synthesis algorithm to flexible manufacturing system
6. A synthesis technique for general Petri nets
7. Extending knitting technique to Petri net synthesis of automated manufacturing systems
8. Dependency analysis-A compositional technique for building large Petri nets
9. A hybrid methodology for Petri net synthesis of manufacturing systems
10. Handles and reachability analysis of free choice nets
11. Complete structural characterization of state machine allocatable nets
12. On liveness in extended non self-controlling nets
13. Liveness in bounded Petri nets which are covered by t-invariants
14. A Petri net based deadlock prevention policy for flexible manufacturing systems