SearcharxivSearch

arXiv subjects

Mila Majster-Cederbaum

Publications and source records attributed to Mila Majster-Cederbaum.

2 recordsLinked to original sources

Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete

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.

cs.CC

Port Protocols for Deadlock-Freedom of Component Systems

In component-based development, approaches for property verification exist that avoid building the global system behavior of the component model. Typically, these approaches rely on the analysis of the local behavior of fixed sized subsystems of components. In our approach, we want to avoid not only the analysis of the global behavior but also of the local behaviors of the components. Instead, we consider very small parts of the local behaviors called port protocols that suffice to verify properties.

cs.LO