Extended synchronized choice nets

Computer Journal

Volumn 46, Issue 5, 2003, Pages 505-523

  Chao, Daniel Yuh ^a  

^a NATIONAL CHENGCHI UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER SIMULATION; FLEXIBLE MANUFACTURING SYSTEMS; GRAPH THEORY; RESOURCE ALLOCATION; SYNCHRONIZATION;

EXTENDED SYNCHRONIZED CHOICE NETS; FREE CHOICE; MARKED GRAPH; RESOURCE SHARING;

PETRI NETS;

EID: 0042912991     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/46.5.505     Document Type: Article

References (23)

1. Chao, D. Y., Zhou, M. C. and Wang, D. T. (1994) Extending knitting technique to Petri net synthesis of automated manufacturing systems. Comp. J., 37, 1-10.
2. Esparza, J. and Silva, M. (1992) A polynomial-time algorithm to decide liveness of bounded free choice nets. Theoret. Comp. Sci., 102, 185-205
3. Barkaoui, K., Couvreur, J. M. and Dutheillet, C. (1995) On liveness in extended non self-controlling nets. In Application and Theory of Petri Nets 1995. Lecture Notes in Computer Science, 935, 25-44.
4. Chao, D. Y. and Nicdao, J. A. (2001) Liveness for synchronized choice Petri nets. Comp. J., 44, 124-136.
5. Esparza, J. and Silva, M. (1990) Circuits, handles, bridges, and nets. In Advances in Petri Nets. Lecture Notes in Computer Science, 483, 210-242.
6. Lautenbach, K. and Ridder, H. (1994) Liveness in bounded Petri nets which are covered by T-invariants. In Application and Theory of Petri Nets 1994, Zaragoza, Spain. Lecture Notes in Computer Science, 815, 358-378.
7. Ezpeleta, J., Colom, J. M. and Martinez, J. (1995) A Petri net based deadlock prevention policy for flexible manufacturing systems. IEEE Trans. Robotics Automation, 11, 173-184.
8. Zhou, M. C. and DiCesare, F. (1991) Parallel and sequential mutual exclusions for Petri net modeling of manufacturing systems with shared resources. IEEE Trans. Robotics Automation, 7, 515-527.
9. Teruel, E., Chrzastowski-Watchel, P., Colom, J. M. and Silva, M. (1992) On Weighted T-systems. Research Report GISI-RR-92-04. Dpto. Ing. Electrica e Informatia, Universidad de Zaragoza, January.
10. Teruel, E., Chrzastowski-Watchel, P., Colom, J. M. and Silva, M. (1992) Lecture Notes in Computer Science, 616, 348-367.
11. Murata, T. (1989) Petri nets: properties, analysis and applications. IEEE Proc., 77, 541-580.
12. Dong-Ik, L., Kumagai, S. and Kodama, S. (1991) Complete structural characterization of state machine allocatable nets. IEICE Trans., E74, 3115-3123.
13. Dong-Ik, L., Kumagai, S. and Kodama, S. (1995) Handles and reachability analysis of free choice nets. In Application and Theory of Petri Nets. Lecture Notes in Computer Science, 935, 298-316.
14. Chao, D. Y. and Wang, D. (1997) Two theoretical and practical aspects of knitting technique-invariants and a new class of Petri net. IEEE Trans. System, Man, Cybernetics, 27, 962-967.
15. Commoner, E. (1972) Deadlocks in Petri Nets. Applied Data Res. Inc., Wakefield, MA.
16. Barkaoui, K. and Pradat-Peyre, J.-F. (1996) On liveness and controlled siphons in Petri nets. Lecture Notes in Computer Science, 1091, 57-72.
17. Chao, D. Y. (1999) Petri net synthesis and synchronization using knitting technique. J. Inform. Sci. Eng., 15, 543-568.
18. Lien, Y. L. (1976) Termination properties of generalized Petri nets. SIAM J. Computers, 5, 251-265.
19. Landwebes, E. H. and Robertson, E. L. (1978) Properties of conflict-free and persistent Petri nets. J. ACM, 25, 352-364.
20. Chao, D. Y. and Wang, D. (1994) A synthesis technique for general Petri nets. J. Syst. Integration, 4, 67-102.
21. Chao, D. Y. (1997) Performance of multi-rate data flow graphs for concurrent processing. J. Inform. Sci. Eng., 13, 85-123.
22. Jeng, M. D. and DiCesare, F. (1995) Synthesis using resource control nets for modeling shared-resource systems. IEEE Trans. Robotics Automation, 11, 317-327.
23. Ezpeleta, J., Garcia-Valles, F. and Colom, J. M. (1998) A class of well structured Petri nets for flexible manufacturing systems. In Application and Theory of Petri Nets. Lecture Notes in Computer Science, 1420, 64-83.