%T Exploiting the Hierarchical Structure of Rule-Based Specifications for Decision Planning
%P 2-16
%O ? IFIP International Federation for Information Processing 2010. The original publication is available at www.springerlink.com.
%V 6117
%I Springer
%S Lecture Notes in Computer Science
%A Alberto Lluch-Lafuente
%A Roberto Bruni
%A Artur Boronat
%A Ugo Montanari
%A Generoso Paolillo
%E John Hatcliff
%E Elena Zucca
%X Rule-based specifications have been very successful as a declarative approach in many domains, due to the handy yet solid foundations offered by rule-based machineries like term and graph rewriting. Realistic problems, however, call for suitable techniques to guarantee scalability. For instance, many domains exhibit a hierarchical structure that can be exploited conveniently. This is particularly evident for composition associations of models. We propose an explicit representation of such structured models and a methodology that exploits it for the description and analysis of model- and rule-based systems. The approach is presented in the framework of rewriting logic and its efficient implementation in the rewrite engine Maude and is illustrated with a case study.
}
%D 2010
%L eprints141
%B Formal Techniques for Distributed Systems (FMOODS/FORTE 2010)
%R 10.1007/978-3-642-13464-7_2