Runtime Verification of Temporal Patterns for Dynamic Reconfigurations of Components

International audienceDynamic reconfigurations increase the availability and the reliability of component-based systems by allowing their architectures to evolve at runtime. Recently we have proposed a temporal pattern logic, called FTPL, to characterize the correct reconfigurations of component-based systems under some temporal and architectural constraints. As component-based architectures evolve at runtime, there is a need to check these FTPL constraints on the fly, even if only a partial information is expected. Firstly, given a generic component-based model, we review FTPL from a runtime verification point of view. To this end we introduce a new four-valued logic, called RV-FTPL (Runtime Verification for FTPL), characterizing the "potential" (un)satisfiability of the architectural constraints in addition to the basic FTPL semantics. Potential true and potential false values are chosen whenever an observed behaviour has not yet lead to a violation or satisfiability of the property under consideration. Secondly, we present a prototype developed to check at runtime the satisfiability of RV-FTPL formulas when reconfiguring a Fractal component-based system. The feasability of a runtime property enforcement is also shown. It consists in supervising on the fly the reconfiguration execution against desired RV-FTPL properties. The main contributions are illustrated on the example of a HTTP server architecture

Strong Structural Controllability and Zero Forcing

In this chapter, we study controllability and output controllability of systems defined over graphs. Specifically, we consider a family of state-space systems, where the state matrix of each system has a zero/non-zero structure that is determined by a given directed graph. Within this setup, we investigate under which conditions all systems in this family are controllable, a property referred to as strong structural controllability. Moreover, we are interested in conditions for strong structural output controllability. We will show that the graph-theoretic concept of zero forcing is instrumental in these problems. In particular, as our first contribution, we prove necessary and sufficient conditions for strong structural controllability in terms of so-called zero forcing sets. Second, we show that zero forcing sets can also be used to state both a necessary and a sufficient condition for strong structural output controllability. In addition to these main results, we include interesting results on the controllability of subfamilies of systems and on the problem of leader selection.</p

Geometric techniques for implicit two-dimensional systems

Geometric tools are developed for two-dimensional (2-D) models in an implicitFornasini–Marchesini form. In particular, the structural properties of controlled and conditionedinvariance are defined and studied. These properties are investigated in terms ofquarter-plane causal solutions of the implicit model given compatible boundary conditions.The definitions of controlled and conditioned invariance introduced, along with the correspondingoutput-nulling and input-containing subspaces, are shown to be richer than theone-dimensional counterparts. The analysis carried out in this paper establishes necessaryand sufficient conditions for the solvability of 2-D disturbance decoupling problems andunknown-input observation problems. The conditions obtained are expressed in terms ofoutput-nulling and input-containing subspaces, which can be computed recursively in a finitenumber of steps