Deadlock-freedom in component systems with architectural constraints

被引:2
|
作者
Martens, Moritz [1 ]
Majster-Cederbaum, Mila [2 ]
机构
[1] Tech Univ Dortmund, Fac Comp Sci, Chair Software Engn, D-44221 Dortmund, Germany
[2] Univ Mannheim, Fac Math & Comp Sci, Chair Pract Comp Sci 2, D-68131 Mannheim, Germany
关键词
Component systems; Deadlock-freedom; Architectural constraints; Interaction systems; Sufficient condition; MULTIPARTY INTERACTIONS; AUTOMATIC VERIFICATION; CONCURRENT SYSTEMS; MODEL CHECKING;
D O I
10.1007/s10703-012-0160-6
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present a compositional analysis of deadlock-freedom in component systems with multiway cooperation. We require the systems to satisfy an architectural constraint which makes sure that the communication structure between the components is given by a tree. Only pairs of components have to be examined for the analysis, therefore the cost is polynomial in the size of the input. We shortly discuss a prototype algorithm which is based on our results and can be used for the investigation of deadlock-freedom of systems satisfying the architectural constraint.
引用
收藏
页码:129 / 177
页数:49
相关论文
共 50 条
  • [21] Efficient Deadlock-Freedom Checking Using Local Analysis and SAT Solving
    Antonino, Pedro
    Gibson-Robinson, Thomas
    Roscoe, A. W.
    INTEGRATED FORMAL METHODS (IFM 2016), 2016, 9681 : 345 - 360
  • [22] A Novel Channel Assignment Method to Ensure Deadlock-Freedom for Deterministic Routing
    Kawano, Ryuta
    Nakahara, Hiroshi
    Tade, Seiichi
    Fujiwara, Ikki
    Matsutani, Hiroki
    Koibuchi, Michihiro
    Amano, Hideharu
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2017, E100D (08): : 1798 - 1806
  • [23] Comparing type systems for deadlock freedom
    Dardha, Ornela
    Perez, Jorge A.
    JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2022, 124
  • [24] Comparing type systems for deadlock freedom
    Dardha, Ornela
    Pérez, Jorge A.
    Journal of Logical and Algebraic Methods in Programming, 2022, 124
  • [25] Type-Based Deadlock-Freedom Verification for Non-Block-Structured Lock Primitives and Mutable References
    Suenaga, Kohei
    PROGRAMMING LANGUAGES AND SYSTEMS, PROCEEDINGS, 2008, 5356 : 155 - 170
  • [26] A Dynamic Sufficient Condition of Deadlock-Freedom for High-Performance Fault-Tolerant Routing in Networks-on-Chips
    Charif, Amir
    Coelho, Alexandre
    Zergainoh, Nacer-Eddine
    Nicolaidis, Michael
    IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING, 2020, 8 (03) : 642 - 654
  • [27] THE PURSUIT OF DEADLOCK FREEDOM
    ROSCOE, AW
    DATHI, N
    INFORMATION AND COMPUTATION, 1987, 75 (03) : 289 - 327
  • [28] Deadlock detection and recovery for component-based systems
    Li, Chen
    Huang, Linpeng
    Chen, Luxi
    Luo, Weichao
    MATHEMATICAL AND COMPUTER MODELLING, 2013, 58 (5-6) : 1362 - 1378
  • [29] Freedom through constraints: User-oriented architectural design
    Niemeijer, R. A.
    de Vries, B.
    Beetz, J.
    ADVANCED ENGINEERING INFORMATICS, 2014, 28 (01) : 28 - 36
  • [30] Deadlock Risk Assessment in Architectural Models of Real-Time Systems
    Monzon, Antonio
    Fernandez-Sanchez, Jose L.
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INDUSTRIAL EMBEDDED SYSTEMS, 2009, : 181 - +