组件交互自动机的划分细化:为什么结构比大小更重要
Partition Refinement of Component Interaction Automata: Why Structure Matters More Than Size
摘要:
基于自动机的建模语言,如组件交互自动机,提供了一种有吸引力的方法来捕获和分析交互组件的行为方面。在这些建模语言的中心,我们发现有限状态机允许细粒度地描述特定服务请求如何以及何时与其他组件或环境交互。不幸的是,基于自动机的方法遭受指数状态爆炸,这是这些形式主义在建模真实世界场景中成功应用的主要障碍。为了应对各个规范的复杂性,我们可以应用分区细化,一种抽象技术,以减轻状态爆炸问题。但这种技术也表现出指数时间和空间复杂度,更糟糕的是,不能提供任何成功的保证。为了更好地理解为什么分区细化在某些情况下成功,而在其他情况下失败,我们进行了一个实证研究的组件交互自动机规范的分区细化算法的性能。因此,我们已经确定了合适的预测分区细化的预期效果。规范的结构而不是大小对分区细化的结果有更大的影响。特别是,用于现实世界系统的组件交互自动机规范能够产生包含结构工件的无标度网络,这些结构工件可以帮助分区细化算法不仅更早地收敛,而且有时还会产生显着的状态空间减少。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。