Symbolic verification of event–condition–action rules in intelligent environments

In this paper we show how state-of-the art SMT-based techniques for software verification can be employed in the verification of event–condition–action rules in intelligent environments. Moreover, we exploit the specific features of intelligent environments to optimise the verification process. We compare our approach with previous work in a detailed evaluation section, showing how it improves both performance and expressivity of the language for event–condition–action rules

Symbolic verification of event–condition–action rules in intelligent environments

In this paper we show how state-of-the art SMT-based techniques for software verification can be employed in the verification of event–condition–action rules in intelligent environments. Moreover, we exploit the specific features of intelligent environments to optimise the verification process. We compare our approach with previous work in a detailed evaluation section, showing how it improves both performance and expressivity of the language for event–condition–action rules

A Formal Model for Event-Condition-Action Rules in Intelligent Environments

We present a formal model for modelling Event-Condition-Action Rules by partitioning a state space and evolution function taking into account the features that are typical of Intelligent Environments. This model allows for a precise definition of formal requirements and for their efficient verification