Empirical rules-based view abstraction for distributed model driven development

Empirical rules are among the most widely employed approaches for processing view abstraction for UML, which can support model simplification, consistency checking, and complexity reduction. However, empirical rules face challenges such as completeness validation, consistency among rules, and composition priority arrangement. The challenge of composition is enlarged in the environment of distributed model-driven development for web service-based systems, where redundant information/data is emphasised. The same redundant information can be expressed in different forms that comprise different topological structures representing the same part of the system. Such variation will result in choosing different compositions of rules executed in different orders, which will increase the severity of the current non-determinism from the empirical probability of some rules. We investigate the effect of redundancy on rule application through designing a simulated distributed storage for an example model. We construct finite-state automaton to unify empirical rules while relieving the side effects caused by redundancy.