%0 Conference Proceedings
%T Exploiting the Hierarchical Structure of Rule-Based Specifications for Decision Planning
%+ Department of Computer Science
%+ Department of Computer Science
%+ IMT Institute for Advanced Studies [Lucca]
%+ Laboratorio CINI-ITEM Carlo Savy
%A Boronat, Artur
%A Bruni, Roberto
%A Lluch Lafuente, Alberto
%A Montanari, Ugo
%A Paolillo, Generoso
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B Joint 12th IFIP WG 6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 30th IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE)
%C Amsterdam, Netherlands
%Y John Hatcliff; Elena Zucca
%I Springer
%3 Formal Techniques for Distributed Systems
%V LNCS-6117
%P 2-16
%8 2010-06-07
%D 2010
%R 10.1007/978-3-642-13464-7_2
%Z Computer Science [cs]/Digital Libraries [cs.DL]Conference papers
%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.
%G English
%2 https://inria.hal.science/hal-01055150/document
%2 https://inria.hal.science/hal-01055150/file/61170002.pdf
%L hal-01055150
%U https://inria.hal.science/hal-01055150
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-LNCS-6117
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-FMOODS
%~ IFIP-2010