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
来源：
FORMAL METHODS IN SYSTEM DESIGN | 2012年 / 41卷 / 02期
关键词：
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 条
  • [1] Deadlock-freedom in component systems with architectural constraints
    Moritz Martens
    Mila Majster-Cederbaum
    Formal Methods in System Design, 2012, 41 : 129 - 177
  • [2] Using Architectural Constraints for Deadlock-Freedom of Component Systems with Multiway Cooperation
    Martens, Moritz
    Majster-Cederbaum, Mila
    THIRD INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF SOFTWARE ENGINEERING, PROCEEDINGS, 2009, : 225 - 232
  • [3] Port Protocols for Deadlock-Freedom of Component Systems
    Lambertz, Christian
    Majster-Cederbaum, Mila
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (38): : 7 - 11
  • [4] Checking deadlock-freedom of parametric component-based systems
    Bozga, Marius
    Iosif, Radu
    Sifakis, Joseph
    JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2021, 119
  • [5] Checking Deadlock-Freedom of Parametric Component-Based Systems
    Bozga, Marius
    Iosif, Radu
    Sifakis, Joseph
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PT II, 2019, 11428 : 3 - 20
  • [6] TESTING DEADLOCK-FREEDOM OF COMPUTER-SYSTEMS
    KAMEDA, T
    JOURNAL OF THE ACM, 1980, 27 (02) : 270 - 280
  • [7] DEADLOCK-FREEDOM IN RESOURCE CONTENTIONS
    CHEN, MC
    REM, M
    ACTA INFORMATICA, 1985, 21 (06) : 585 - 598
  • [8] A polynomial-time checkable sufficient condition for deadlock-freedom of component-based systems
    Majster-Cederbaum, Mila
    Martens, Moritz
    Minnameier, Christoph
    SOFSEM 2007: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2007, 4362 : 888 - +
  • [9] DEADLOCK-FREEDOM OF LARGE TRANSACTIONS IN OBJECT MANAGEMENT-SYSTEMS
    KELTER, U
    INFORMATION SYSTEMS, 1989, 14 (02) : 175 - 180
  • [10] Verifying Deadlock-Freedom of Communication Fabrics
    Gotmanov, Alexander
    Chatterjee, Satrajit
    Kishinevsky, Michael
    VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION, 2011, 6538 : 214 - +
12345