메뉴 건너뛰기




Volumn 34, Issue 1, 2004, Pages 52-64

Supervisory Control for Deadlock Avoidance in Compound Processes

Author keywords

Assembly disassembly process; Deadlock avoidance; Discrete event system; Supervisory control

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; GRAPHIC METHODS; MACHINING; MATHEMATICAL MODELS; RESOURCE ALLOCATION; ROBOTS; STOCHASTIC CONTROL SYSTEMS; SYNCHRONIZATION;

EID: 0742290179     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCA.2003.820572     Document Type: Article
Times cited : (57)

References (21)
  • 2
    • 38249024213 scopus 로고
    • Equivalence relations in queueing models of fork/join networks with blocking
    • Y. Dallery, Z. Liu, and D. Towsley, "Equivalence relations in queueing models of fork/join networks with blocking," Perform. Eval., vol. 10, pp. 233-245, 1989.
    • (1989) Perform. Eval. , vol.10 , pp. 233-245
    • Dallery, Y.1    Liu, Z.2    Towsley, D.3
  • 3
    • 0028513743 scopus 로고
    • Equivalence, reversibility, symmetry and concavity properties of fork/join networks with blocking
    • _, "Equivalence, reversibility, symmetry and concavity properties of fork/join networks with blocking," J. ACM, vol. 41, no. 5, pp. 903-942, 1994.
    • (1994) J. ACM , vol.41 , Issue.5 , pp. 903-942
  • 4
    • 0010225535 scopus 로고    scopus 로고
    • Decidability and complexity of Petri net problems - An introduction
    • NewYork: Springer-Verlag, Lecture Notes in Computer Science
    • J. Esparza, "Decidability and complexity of Petri net problems - An introduction," in Lectures on Petri Nets I: Basic Models. Advances in Petri Nets. NewYork: Springer-Verlag, 1998, vol. 1491, Lecture Notes in Computer Science.
    • (1998) Lectures on Petri Nets I: Basic Models. Advances in Petri Nets , vol.1491
    • Esparza, J.1
  • 5
    • 0001683140 scopus 로고
    • Decibility issues for Petri nets - A survey
    • J. Esparza and M. Nielsen, "Decibility issues for Petri nets - A survey," J. Informatik Process, Cybern., vol. 30, no. 3, pp. 143-160, 1994.
    • (1994) J. Informatik Process, Cybern. , vol.30 , Issue.3 , pp. 143-160
    • Esparza, J.1    Nielsen, M.2
  • 7
    • 0742302069 scopus 로고    scopus 로고
    • Design and implementation of supervisors avoiding deadlocks in flexible assembly systems
    • _, "Design and implementation of supervisors avoiding deadlocks in flexible assembly systems," in Proc. IEEE-SMC Multiconf. Computat. Eng. Syst. Applicat., 1998.
    • (1998) Proc. IEEE-SMC Multiconf. Computat. Eng. Syst. Applicat.
  • 10
    • 0028532621 scopus 로고
    • Optimal centralized algorithms for store-and-forward deadlock avoidance
    • Nov.
    • J. Blazewicz, D. P. Bovet, J. Brzezinski, G. Gambosi, and M. Talamo, "Optimal centralized algorithms for store-and-forward deadlock avoidance," IEEE Trans. Comput., vol. 43, pp. 1333-1338, Nov. 1994.
    • (1994) IEEE Trans. Comput. , vol.43 , pp. 1333-1338
    • Blazewicz, J.1    Bovet, D.P.2    Brzezinski, J.3    Gambosi, G.4    Talamo, M.5
  • 11
    • 0032682125 scopus 로고    scopus 로고
    • Optimal rate allocation in unreliable assembly/disassembly production networks with blocking
    • V. S. Kouikoglou, "Optimal rate allocation in unreliable assembly/disassembly production networks with blocking," in Proc. IEEE Int. Conf. Robotics Automat., 1999, pp. 1126-1131.
    • (1999) Proc. IEEE Int. Conf. Robotics Automat. , pp. 1126-1131
    • Kouikoglou, V.S.1
  • 12
    • 0035481906 scopus 로고    scopus 로고
    • Deadlock avoidance for sequential resource allocation systems: Hard and easy cases
    • M. A. Lawley and S. A. Reveliotis, "Deadlock avoidance for sequential resource allocation systems: Hard and easy cases," The Int. J. FMS, vol. 13, no. 4, pp. 385-404, 2001.
    • (2001) The Int. J. FMS , vol.13 , Issue.4 , pp. 385-404
    • Lawley, M.A.1    Reveliotis, S.A.2
  • 14
    • 0042221729 scopus 로고
    • Throughput equivalencies in fork/join queueing networks with finite buffers and general service times
    • C. Paik and D. Tcha, "Throughput equivalencies in fork/join queueing networks with finite buffers and general service times," Int. J. Prod. Res., vol. 33, no. 3, pp. 695-703, 1995.
    • (1995) Int. J. Prod. Res. , vol.33 , Issue.3 , pp. 695-703
    • Paik, C.1    Tcha, D.2
  • 16
    • 34548264749 scopus 로고
    • CAST tools for automatic FMS dynamics models synthesis
    • New York: Springer-Verlag, Lecture Notes on Computer Science
    • _, "CAST tools for automatic FMS dynamics models synthesis," in Computer Aided Systems Theory. New York: Springer-Verlag, 1992, vol. 585, Lecture Notes on Computer Science, pp. 412-421.
    • (1992) Computer Aided Systems Theory , vol.585 , pp. 412-421
  • 18
    • 0029349784 scopus 로고
    • Programming, scheduling, and control of flexible assembly systems
    • P. Valckenaers, H. V. Brussel, L. Bongaerts, and F. Bonneville, "Programming, scheduling, and control of flexible assembly systems," Comput. Ind., vol. V26, no. N3, pp. 209-218, 1995.
    • (1995) Comput. Ind. , vol.V26 , Issue.N3 , pp. 209-218
    • Valckenaers, P.1    Brussel, H.V.2    Bongaerts, L.3    Bonneville, F.4
  • 21
    • 0742284786 scopus 로고    scopus 로고
    • [Online]
    • Flexible Assembly Testbed. [Online], Available: http://www.mech.kuleuven.ac.be/pma/project/goa/testb1.html
    • Flexible Assembly Testbed


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