On the algebraic semantics of reactive rules

Abstract

Service oriented architectures and event driven enviroments are becoming dominant over the web. Reactive Rules expressed by Rule Markup Languages are used to define the system's reactions. In this paper we present a Hidden (Sorted) Algebra approach to some of the most common families of Reactive Rules. This semantics will allow the mapping between Rule Markup Languages and Behavioral Algebraic Specification Languages. Verification techniques for reactive rules, will provide automated reasoning capabilities and support the development of new rule based policies and trust models. © 2012 Springer-Verlag.