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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aldini, A., Bernardo, M., Corradini, F.: A process algebraic approach to software architecture design. Springer, Heidelberg (2010)
Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. Journal of the ACM 44(2), 201–236 (1997)
Boronat, A., Meseguer, J.: An algebraic semantics for MOF. In: Fiadeiro, J.L., Inverardi, P. (eds.) FASE 2008. LNCS, vol. 4961, pp. 377–391. Springer, Heidelberg (2008)
Bruni, R., Lluch Lafuente, A., Montanari, U., Tuosto, E.: Style based architectural reconfigurations. EATCS 94, 161–180 (2008)
Clavel, M., Durán, F., Eker, S., Lincoln, P., MartÃ-Oliet, N., Meseguer, J., Talcott, C. (eds.): All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007)
Coles, A., Fox, M., Halsey, K., Long, D., Smith, A.: Managing concurrency in temporal planning using planner-scheduler interaction. Journal on Artificial Intelligence 173(1), 1–44 (2009)
Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Springer, Heidelberg (March 2006)
Giunchiglia, F., Traverso, P.: Planning as model checking. In: Biundo, S., Fox, M. (eds.) ECP 1999. LNCS, vol. 1809, pp. 1–20. Springer, Heidelberg (2000)
Hölzl, M., Meier, M., Wirsing, M.: Which soft constraints do you prefer? In: Proceedings of the 7th International Workshop on Rewriting Logic and its Applications (WRLA 2008). ENTCS, vol. 238(3), pp. 189–205. Elsevier, Amsterdam (2008)
Katoen, J.-P.: Advances in probabilistic model checking. In: Barthe, G., Hermenegildo, M.V. (eds.) VMCAI 2010. LNCS, vol. 5944, p. 25. Springer, Heidelberg (2009)
Kumar, N., Sen, K., Meseguer, J., Agha, G.: A rewriting based model for probabilistic distributed object systems. In: Najm, E., Nestmann, U., Stevens, P. (eds.) FMOODS 2003. LNCS, vol. 2884, pp. 32–46. Springer, Heidelberg (2003)
Lanese, I., Montanari, U.: Synchronization algebras with mobility for graph transformations. In: Proceedings of the 3rd Joint Workshops on Foundations of Global Ubiquitous Computing (FGUC 2004). ENTCS, vol. 138(1), pp. 43–60. Elsevier, Amsterdam (2005)
Lluch Lafuente, A., Montanari, U.: Quantitative mu-calculus and CTL defined over constraint semirings. TCS 346(1), 135–160 (2005)
Meseguer, J.: Conditional rewriting logic as a united model of concurrency. TCS 96(1), 73–155 (1992)
Ölveczky, P.C., Meseguer, J.: Specification of real-time and hybrid systems in rewriting logic. TCS 285(2), 359–405 (2002)
Plotkin, G.D.: A structural approach to operational semantics. Journal of Logic and Algebraic Programming 60-61, 17–139 (2004)
Rote, G.: A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion). Journal on Computing 34(3) (1985)
Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach. Pearson Education, London (2003)
Seidewitz, E.: What models mean. IEEE Journal on Software 20(5), 26–32 (2003)
Verdejo, A., MartÃ-Oliet, N.: Executable structural operational semantics in Maude. Journal of Logic and Algebraic Programming 67(1-2), 226–293 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. FMOODS FORTE 2010 2010. Lecture Notes in Computer Science, vol 6117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13464-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-13464-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13463-0
Online ISBN: 978-3-642-13464-7
eBook Packages: Computer ScienceComputer Science (R0)