Everything Is PSPACE-Complete in Interaction Systems

Majster-Cederbaum, Mila; Minnameier, Christoph

doi:10.1007/978-3-540-85762-4_15

Cited by 10 publications

(4 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We showed that even for these simply structured systems deciding the reachability problem is PSPACE-complete. These results strengthen PSPACE-completeness results of the reachability problem in general interaction systems [18]. The formalism of interaction systems is very basic, and thus our results are easily applicable to other formalisms that model cooperating systems.…”

Section: Conclusion and Related Worksupporting

confidence: 83%

“…The reachable state space of such systems can be exponentially large in the number of subsystems what is referred to as the state space explosion problem. Moreover, there are PSPACE-completeness results for the reachability problem in various formalisms that model cooperating systems, e.g., see [18] for interaction systems, [13] for results in 1-conservative Petri nets and [7] for results in 1-save Petri nets. Clearly, all methods that rely on the exploration of the reachable state space of cooperating systems suffer from these results.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete

Majster-Cederbaum

Semmelrock

2013

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard 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.

show abstract

Section: Conclusion and Related Worksupporting

confidence: 83%

Section: Introductionmentioning

confidence: 99%

Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete

Majster-Cederbaum

Semmelrock

2013

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Checking deadlock-freedom is difficult. It has been shown that deciding deadlock-freedom for interaction systems is PSPACE-complete [27]. As explained in the introduction there are various strategies to address this problem.…”

Section: Interaction Systemsmentioning

confidence: 99%

“…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

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