State Space Reduction Techniques for Component Interfaces

Lumpe, Markus; Grunske, Lars; Schneider, Jean-Guy

doi:10.1007/978-3-540-87891-9_9

Cited by 6 publications

(13 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Partition refinement through weak bisimulation can alleviate the impact of state explosion, but this technique too exhibits exponential time and space complexity [16]. Worse, success is erratic.…”

Section: Resultsmentioning

confidence: 99%

“…This algorithm is part of our experimental composition framework for Component Interaction Automata, implemented in PLT-Scheme, that provides support not only for the specification and refinement of component interaction automata, but also for the extraction of metrics data [16,15].…”

Section: Partition Refinement For Component Interaction Automatamentioning

confidence: 99%

“…In particular, we have developed a bisimulation-based partition refinement algorithm for Component Interaction Automata [16,15]. Partition refinement [11] constructs, if possible, a new image of a given automaton, where the states of the new automaton correspond to the equivalence classes of the old automaton.…”

Section: Introductionmentioning

confidence: 99%

“…For Component Interaction Automata we use weak bisimluation, a behavioral equivalence relation that abstracts from internal component synchronizations. In other words, partition refinement for Component Interaction Automata equates both behavioral equivalent substructures of an automaton and states that are solely connected by internal component synchronizations [16,15]. Consider, for example, the graphical representation of the automata C620C915 and C620915 shown in Figure 1.…”

Section: Introductionmentioning

confidence: 99%

“…It order to identify the reasons as to why partition refinement can sometimes yield strong state space reduction ratios [16], while it fails completely on other occasions, we have run an analysis on a sample of 1,680 experimental composite systems. Each system consists of between 2 and 11 machine-generated Component Interaction Automata specifications that all enjoy topological properties similar to real-world software systems [27,26].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Partition Refinement of Component Interaction Automata: Why Structure Matters More Than Size

Lumpe

Vasa

2010

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Automata-based modeling languages, like Component Interaction Automata, offer an attractive means to capture and analyze the behavioral aspects of interacting components. At the center of these modeling languages we find finite state machines that allow for a fine-grained description how and when specific service requests may interact with other components or the environment. Unfortunately, automata-based approaches suffer from exponential state explosion, a major obstacle to the successful application of these formalisms in modeling real-world scenarios. In order to cope with the complexity of individual specifications we can apply partition refinement, an abstraction technique to alleviate the state explosion problem. But this technique too exhibits exponential time and space complexity and, worse, does not offer any guarantees for success. To better understand as to why partition refinement succeeds in some cases while it fails in others, we conducted an empirical study on the performance of a partition refinement algorithm for Component Interaction Automata specifications. As a result we have identified suitable predictors for the expected effectiveness of partition refinement. It is the structure, not the size, of a specification that weighs heavier on the outcome of partition refinement. In particular, Component Interaction Automata specifications for real-world systems are capable of producing scale-free networks containing structural artifacts that can assist the partition refinement algorithm not only converge earlier, but also yield a significant state space reduction on occasion.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Partition Refinement For Component Interaction Automatamentioning

confidence: 99%