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

Abstract

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.

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

“…There are several efforts on the verification of Component-based Systems [BCD02,MCM08,HJK10b,MW97,All97]. The scalability issue in compositional verification has been actively addressed in this field; compositional verification is based on the idea that the correctness check of a complex system can be divided into smaller verification tasks for its components.…”

Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete

“…Interaction systems have been proposed by Sifakis and Gössler in [10] to model cooperating systems. The model was studied, e.g., in [16,3,5,20,9]. An interaction system consists of components which cooperate through so called interactions.…”

“…An efficient technique based on a sufficient conditions for establishing deadlock-freedom in interaction systems with a star-like communication pattern is introduced in [14] where, similar to [4], a compatibility condition based on branching bisimilarity is tested. A sufficient condition for establishing deadlock-freedom for the subclass of tree-like interaction systems is described in [16] where a condition is tested on the reachable state spaces of pairs of interacting components. In [15] the condition in [16] is extended such that deadlock-freedom can be established in a proper superclass of tree-like interaction systems.…”

“…A sufficient condition for establishing deadlock-freedom for the subclass of tree-like interaction systems is described in [16] where a condition is tested on the reachable state spaces of pairs of interacting components. In [15] the condition in [16] is extended such that deadlock-freedom can be established in a proper superclass of tree-like interaction systems. Hennicker et al proposed in [2,11] a technique to construct so called observable behavior of a cooperating system with an acyclic communication pattern which can be used to establish certain system properties.…”

“…Also approaches that guarantee correctness by construction, i.e., modeling rules that ensure certain system properties, and are based on structural restrictions become justified by our results. See for example [16,11,14,15,12,6,4] for approaches that treat these topics.The paper is organized as follows. Section 2 contains the definitions.…”