Abstract
We describe our effort to evaluate the syntax and constraints of Promise Theory using a tool developed in the Maude framework. Through the development of a Maude module we are able to do searches and queries in all possible syntactically valid Promise expressions of an arbitrary initial state of participants and constraints. We use this approach to improve the set of grammatical rules that is already available.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Burgess, M., Fagernes, S.: Pervasive Computer Management: A Smart Mall Scenario Using Promise Theory. In: Proceedings of MACE, Multicon Lecture Notes, p. 133 (2006)
Begnum, K., Burgess, M., Sechrest, J.: Adaptive provisioning using virtual machines and autonomous role-based management. In: ICAS’06 - SELF workshop - Self-adaptability and self-management of context-aware systems, IEEE, Los Alamitos (2006)
The Maude Homepage, http://maude.cs.uiuc.edu/
Ölveczky, P.C., Meseguer, J.: Specification and Analysis of Real-Time Systems Using Real-Time Maude. In: Fundamental Approaches to software Engineering (FASE). Lecure Notes in Computer Science, vol. 2984, Springer, Heidelberg (2004)
Durán, F., Verdejo, A.: A Conference Reviewing System in Mobile Maude. In: WRLA 2002. Proceedings Fourth International Workshop on Rewriting Logic and its Applications, Pisa, Italy, pp. 19–21. Elsevier, North-Holland, Amsterdam (2002)
Burgess, M., Begnum, K.: Voluntary cooperation in pervasive computing services. In: Proceedings of the Nineteenth Systems Administration Conference (LISA XIX) (USENIX Association: Berkeley, CA), p. 143 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Begnum, K., Burgess, M. (2007). Understanding Promise Theory Using Rewriting Logic. In: Bandara, A.K., Burgess, M. (eds) Inter-Domain Management. AIMS 2007. Lecture Notes in Computer Science, vol 4543. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72986-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-72986-0_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72985-3
Online ISBN: 978-3-540-72986-0
eBook Packages: Computer ScienceComputer Science (R0)