Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets

Lecture Notes in Computer Science

Martens

2007

Self 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.

Section: Testing Robustnessmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Robustness in Interaction Systems

Lecture Notes in Computer Science

Martens

2007

Self Cite

“…Theoretical results [26,27] show that deciding virtually any important property of interaction systems is PSPACE-complete. In order to deal with this situation one can conceive various strategies:…”

Section: Introductionmentioning

confidence: 99%

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

Proceedings of the 8th ACM International Conference on Embedded Software

Martens

2008

Self 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.

“…The results in this paper can be easily applied to other formalisms that model cooperating systems. This can be achieved by either adapting the results, e.g., the formalism of interface automata [1] comes close to interaction systems, or by using a mapping among formalisms, e.g., a mapping between interaction systems and 1-save Petri nets can be found in [17].Deciding the reachability problem in general interaction systems is PSPACE-complete [18]. Here we strengthen this result by showing that the reachability problem remains PSPACE-complete in subclasses consisting of interaction systems the communication structure of which forms a star or a linear sequence of components.…”

mentioning

confidence: 99%

mentioning

confidence: 99%

Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete

Electron. Proc. Theor. Comput. Sci.

Semmelrock

2013

Self Cite

The reachability problem in cooperating systems is known to be PSPACE-complete. We show here that this problem remains PSPACE-complete when we restrict the communication structure between the subsystems in various ways. For this purpose we introduce two basic and incomparable subclasses of cooperating systems that occur often in practice and provide respective reductions. The subclasses we consider consist of cooperating systems the communication structure of which forms a line respectively a star.