Connectors synthesis for deadlock-free component based architectures

被引:7
|
作者
Inverardi, P [1 ]
Scriboni, S [1 ]
机构
[1] Univ Aquila, Dipartimento Informat, I-67100 Laquila, Italy
关键词
D O I
10.1109/ASE.2001.989803
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Nowadays component-based technologies offer straightforward ways of building applications out of existing components. Although these technologies might differ in terms of the level of heterogeneity among components they support, e.g. CORBA or COM versus J2EE, they all suffer the problem of dynamic integration. That is, once components are successfully integrated in a uniform context how is it possible to check, control and assess that the dynamic behavior of the resulting application will not deadlock? In this paper we propose an architectural, connector-based approach to this problem. We compose a system in such a way that it is possible to check whether and why the system deadlocks. Depending. on the kind of deadlock, we have a strategy that automatically operates on the connector part of the system architecture in order to obtain a suitably equivalent version of the system which is deadlock-free.
引用
收藏
页码:174 / 181
页数:8
相关论文
共 50 条
  • [1] Deadlock-free software architectures for COM/DCOM applications
    Inverardi, P
    Tivoli, M
    JOURNAL OF SYSTEMS AND SOFTWARE, 2003, 65 (03) : 173 - 183
  • [2] THE SYNTHESIS OF DEADLOCK-FREE INTERPROCESS COMMUNICATIONS
    CARPENTER, GF
    MICROPROCESSING AND MICROPROGRAMMING, 1990, 30 (1-5): : 695 - 701
  • [3] Component-based construction of deadlock-free systems -: Extended abstract
    Gössler, G
    Sifakis, J
    FST TCS 2003: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 2003, 2914 : 420 - 433
  • [4] SYNTHESIS OF A CLASS OF DEADLOCK-FREE PETRI NETS
    DATTA, A
    GHOSH, S
    JOURNAL OF THE ACM, 1984, 31 (03) : 486 - 506
  • [5] Deadlock-free routing based on ordered links
    Chiu, DM
    Kadansky, M
    Perlman, R
    Reynders, J
    Steele, G
    Yuksel, M
    LCN 2002: 27TH ANNUAL IEEE CONFERENCE ON LOCAL COMPUTER NETWORKS, PROCEEDINGS, 2002, : 62 - 71
  • [6] MODULAR SYNTHESIS OF DEADLOCK-FREE CONTROL-STRUCTURES
    DATTA, AK
    GHOSH, S
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 241 : 288 - 318
  • [7] On deadlock-free scheduling in FMS
    Ben Abdallah, I
    ElMekkawy, T
    ElMaraghy, HA
    1998 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5, 1998, : 366 - 371
  • [8] Deadlock-free interval labelling
    Firth, MA
    Jones, A
    MICROPROCESSORS AND MICROSYSTEMS, 1998, 21 (7-8) : 441 - 454
  • [9] Deadlock-Free Channels and Locks
    Leino, K. Rustan M.
    Mueller, Peter
    Smans, Jan
    PROGRAMMING LANGUAGES AND SYSTEMS, PROCEEDINGS, 2010, 6012 : 407 - +
  • [10] State feedback based deadlock-free supervisor synthesis for bounded Petri nets
    Ru, Y
    Wu, WM
    Su, HY
    Chu, J
    2004 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN & CYBERNETICS, VOLS 1-7, 2004, : 1666 - 1671