No abstract

Abstract. We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized Büchi automaton for the negation of the formula and the emptiness check. Our algorithm first converts the LTL formula into a linear weak alternating automaton; configurations of the alternating automaton correspond to the locations of a generalized Büchi automaton, and a variant of Tarjan's algorithm is used to decide the existence of an accepting run of the product of the transition system and the automaton. Because we avoid an explicit construction of the Büchi automaton, our approach can yield significant improvements in runtime and memory, for large LTL formulas. The algorithm has been implemented within the SPIN model checker, and we present experimental results for some benchmark examples.

As software is more and more interweaving with our everyday life, designing software in a way that it reflects and respects the user and her emotional physical conditions, cognitive engagement, and emotional state, become imperative. However, how such humancentred pervasive adaptive applications are to be designed and realized is still hardly understood. Both engineering approaches and runtime support for such applications are still in their infancy. In this paper, we present the REFLECTive middleware, a framework that facilitates the development and operation of such applications. The middleware is explained on the base of an envisioned example, the affective music player. By offering design patterns geared towards pervasive adaptive applications and leveraging them for achieving adaptivity, the REFLECTive middleware support a systematic and clear approach to engineering and deploying human-centred pervasive adaptive applications in daily life situations.

No abstract

No abstract