메뉴 건너뛰기




Volumn 23, Issue 3, 2007, Pages 853-867

Searching strict minimal siphons for SNC-based resource allocation systems

Author keywords

Algorithm; Deadlock; FMS; Liveness; Petri nets; Siphons; Traps

Indexed keywords

ALGORITHMS; PETRI NETS; RESOURCE ALLOCATION;

EID: 34249651798     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (13)

References (17)
  • 1
    • 0742307433 scopus 로고    scopus 로고
    • Elementary siphons of Petri nets and their application to deadlock prevention in flexible manufacturing systems
    • Z. Li and M. Zhou, "Elementary siphons of Petri nets and their application to deadlock prevention in flexible manufacturing systems," IEEE Transactions on Systems, Man, and Cybernetics, Part A, Vol. 34, 2004, pp. 38-51.
    • (2004) IEEE Transactions on Systems, Man, and Cybernetics, Part A , vol.34 , pp. 38-51
    • Li, Z.1    Zhou, M.2
  • 2
    • 0344359093 scopus 로고    scopus 로고
    • Time complexity analysis of the minimal siphon extraction problem of Petri nets
    • M. Yamauchi and T. Watanabe, "Time complexity analysis of the minimal siphon extraction problem of Petri nets," IEICE Transactions on Fundamentals, Vol. E82-A, 1999, pp. 2558-2565.
    • (1999) IEICE Transactions on Fundamentals , vol.E82-A , pp. 2558-2565
    • Yamauchi, M.1    Watanabe, T.2
  • 3
    • 0035653174 scopus 로고    scopus 로고
    • Liveness for synchronized choice Petri nets
    • D. Y. Chao and J. A. Nicdao, "Liveness for synchronized choice Petri nets," Computer Journal, Vol. 44, 2001, pp. 124-136.
    • (2001) Computer Journal , vol.44 , pp. 124-136
    • Chao, D.Y.1    Nicdao, J.A.2
  • 4
    • 85027118558 scopus 로고
    • Linear time algorithm to find a minimal deadlock in a strongly connected free-choice net
    • M. A. Marsan, eds, Application and Theory of Petri Nets, Springer Verlag
    • P. Kemper, "Linear time algorithm to find a minimal deadlock in a strongly connected free-choice net," M. A. Marsan, eds., Application and Theory of Petri Nets, LNCS 691, Springer Verlag, 1993, pp. 319-338.
    • (1993) LNCS , vol.691 , pp. 319-338
    • Kemper, P.1
  • 5
    • 0029288298 scopus 로고
    • A Petri net based deadlock prevention policy for flexible manufacturing systems
    • J. Ezpeleta, J. M. Colom, and J. Martinez, "A Petri net based deadlock prevention policy for flexible manufacturing systems," IEEE Transactions on Robotics and Automation, Vol. 11, 1995, pp. 173-184.
    • (1995) IEEE Transactions on Robotics and Automation , vol.11 , pp. 173-184
    • Ezpeleta, J.1    Colom, J.M.2    Martinez, J.3
  • 7
    • 0035471203 scopus 로고    scopus 로고
    • Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
    • J. Park and S. A. Reveliotis, "Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings," IEEE Transactions on Automatic Control, Vol. 46, 2001, pp. 1572-1583.
    • (2001) IEEE Transactions on Automatic Control , vol.46 , pp. 1572-1583
    • Park, J.1    Reveliotis, S.A.2
  • 8
    • 29144497450 scopus 로고    scopus 로고
    • Modeling, analysis, deadlock prevention and cell controller implementation for flexible manufacturing systems,
    • Ph.D. Dissertation, Dept. of Electrical Engineering, National Taiwan University of Science and Technology, Taiwan
    • Y. Huang, "Modeling, analysis, deadlock prevention and cell controller implementation for flexible manufacturing systems," Ph.D. Dissertation, Dept. of Electrical Engineering, National Taiwan University of Science and Technology, Taiwan, 2001.
    • (2001)
    • Huang, Y.1
  • 10
    • 33745726710 scopus 로고    scopus 로고
    • Computation of elementary siphons in Petri nets for deadlock control
    • D. Y. Chao, "Computation of elementary siphons in Petri nets for deadlock control," Computer Journal, Vol. 49, 2006, pp. 470-479.
    • (2006) Computer Journal , vol.49 , pp. 470-479
    • Chao, D.Y.1
  • 11
    • 33846659736 scopus 로고    scopus 로고
    • An incremental approach to extract minimal bad siphons
    • D. Y. Chao, "An incremental approach to extract minimal bad siphons," Journal of Information Science and Engineering, Vol. 23, 2007, pp. 203-214.
    • (2007) Journal of Information Science and Engineering , vol.23 , pp. 203-214
    • Chao, D.Y.1
  • 12
    • 0001790593 scopus 로고
    • Depth-first search and linear graph algorithms
    • R. Tarjan, "Depth-first search and linear graph algorithms," SIAM Journal on Computing, Vol. 1, 1972, pp. 146-160.
    • (1972) SIAM Journal on Computing , vol.1 , pp. 146-160
    • Tarjan, R.1
  • 13
    • 0001909598 scopus 로고
    • Finding all the elementary circuits of a directed graph
    • D. B. Johnson, "Finding all the elementary circuits of a directed graph," SIAM Journal on Computing, Vol. 4, 1975, pp. 77-84.
    • (1975) SIAM Journal on Computing , vol.4 , pp. 77-84
    • Johnson, D.B.1
  • 14
    • 0031362845 scopus 로고    scopus 로고
    • Deadlock analysis of Petri nets using siphons and mathematical programming
    • F. Chu and X. L. Xie, "Deadlock analysis of Petri nets using siphons and mathematical programming," IEEE Transactions on Robotics and Automation, Vol. 13, 1997, pp. 793-804.
    • (1997) IEEE Transactions on Robotics and Automation , vol.13 , pp. 793-804
    • Chu, F.1    Xie, X.L.2
  • 16
    • 0031364060 scopus 로고    scopus 로고
    • Two theoretical and practical aspects of knitting technique - invariants and a new class of Petri net
    • D. Y. Chao and D. T. Wang, "Two theoretical and practical aspects of knitting technique - invariants and a new class of Petri net," IEEE Transactions on Systems, Man, Cybernetics, Part B, Vol. 27, 1997, pp. 962-977.
    • (1997) IEEE Transactions on Systems, Man, Cybernetics, Part B , vol.27 , pp. 962-977
    • Chao, D.Y.1    Wang, D.T.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.