Exploiting the Hierarchical Structure of Rule-Based Specifications for Decision Planning

  • Artur Boronat
  • Roberto Bruni
  • Alberto Lluch Lafuente
  • Ugo Montanari
  • Generoso Paolillo
Conference paper

DOI: 10.1007/978-3-642-13464-7_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6117)
Cite this paper as:
Boronat A., Bruni R., Lluch Lafuente A., Montanari U., Paolillo G. (2010) Exploiting the Hierarchical Structure of Rule-Based Specifications for Decision Planning. In: Hatcliff J., Zucca E. (eds) Formal Techniques for Distributed Systems. Lecture Notes in Computer Science, vol 6117. Springer, Berlin, Heidelberg

Abstract

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Artur Boronat
    • 1
  • Roberto Bruni
    • 2
  • Alberto Lluch Lafuente
    • 3
  • Ugo Montanari
    • 2
  • Generoso Paolillo
    • 4
  1. 1.Department of Computer ScienceUniversity of LeicesterUK
  2. 2.Department of Computer ScienceUniversity of PisaItaly
  3. 3.IMT Institute for Advanced Studies LuccaItaly
  4. 4.Laboratorio CINI-ITEM Carlo SavyNaplesItaly

Personalised recommendations