Liveness in Interaction Systems

Majster-Cederbaum, Mila; Martens, Moritz; Minnameier, Christoph

doi:10.1016/j.entcs.2008.06.021

Cited by 6 publications

(4 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The properties are local/global deadlock-freedom, local progress of a set of components and liveness. These properties of interaction systems have been studied in detail in [22,18,19,17,15]. In Sect.…”

Section: Properties Of Interaction Systemsmentioning

confidence: 99%

“…From our results about the PSPACE-hardness of deciding deadlock-freedom [16] and NP-hardness of deciding liveness of a set of components [15,17] it is clear that deciding robustness of deadlock-freedom w.r.t. A A respectively liveness without A A is at least as hard.…”

Section: Testing Robustnessmentioning

confidence: 99%

“…In [15,16,17] it is shown that deciding deadlock-freedom is PSPACE-hard and deciding liveness is NP-hard for interaction systems. However, as the information about the individual components is maintained in the model it can be exploited to develop sufficient conditions for the desired properties that can be tested in polynomial time [18,19,17]. As violations of safety properties can be expressed as deadlocks broad classes of properties can be handled in this approach.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Robustness in Interaction Systems

Majster-Cederbaum

Martens

2007

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract.We treat the effect of absence/failure of ports or components on properties of component-based systems. We do so in the framework of interaction systems, a formalism for component-based systems that strictly separates the issues of local behavior and interaction, for which ideas to establish properties of systems were developed. We propose how to adapt these ideas to analyze how the properties behave under absence or failure of certain components or merely some ports of components. We demonstrate our approach for the properties local and global deadlockfreedom as well as liveness and local progress.

show abstract

Section: Properties Of Interaction Systemsmentioning

confidence: 99%

Section: Testing Robustnessmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Robustness in Interaction Systems

Majster-Cederbaum

Martens

2007

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [16,15,24,23,25] we took the first approach for general interaction systems. First attempts to exploit compositionality can be found in [24,21,3,1].…”

Section: Introductionmentioning

confidence: 99%

Compositional analysis of deadlock-freedom for tree-like component architectures

Majster-Cederbaum

Martens

2008

Proceedings of the 8th ACM International Conference on Embedded Software

Self Cite

View full text Add to dashboard Cite

We study architectural constraints for component systems in order to be able to guarantee safety-properties. Representing safety-properties, we investigate deadlock-freedom. We present a compositional and hence polynomial time condition for deadlock-freedom for a class of component-systems whose architecture is tree-like. The architectural constraints that are developed can be understood as a design pattern that helps to construct systems satisfying safety-properties on the one hand. On the other hand, they might help to draw attention to potentially critical situations in a design. To model component-systems we use the formalism of interaction systems as proposed by Sifakis et al. The ideas can be transferred to other formal models where subsystems are cooperating via synchronous communication.

show abstract

Rigorous development of component-based systems using component metadata and patterns

et al. 2016

View full text Add to dashboard Cite

In previous work we presented a CSP-based systematic approach that fosters the rigorous design of component-based development (CBD). Our approach is strictly defined in terms of composition rules, which are the only permitted way to compose components. These rules guarantee the preservation of properties (particularly deadlock-freedom) by construction in component composition. Nevertheless, their application is allowed only under certain conditions whose verification via model checking turned out impracticable even for some simple designs, and particularly those involving cyclic topologies. In this paper, we address the performance of the analysis and present a significantly more efficient alternative to the verification of the rule side conditions, which are improved by carrying out partial verification on component metadata throughout component compositions and by using behavioural patterns. The use of metadata, together with behavioural patterns, demands new composition rules, which allow previous exponential time verifications to be carried out now in linear time. Two case studies (the classical dining philosophers, also used as a running example, and an industrial version of the leadership election algorithm) are presented to illustrate and validate the overall approach.

show abstract

Liveness in Interaction Systems

Cited by 6 publications

References 30 publications

Robustness in Interaction Systems

Robustness in Interaction Systems

Compositional analysis of deadlock-freedom for tree-like component architectures

Rigorous development of component-based systems using component metadata and patterns

Contact Info

Product

Resources

About