Integrating discrete controller synthesis into a reactive programming language compiler

Abstract

We define a mixed imperative/declarative programming language: declarative contracts are enforced upon imperatively described behaviors. This paper describes the semantics of the language, making use of the notion of Discrete Controller Synthesis (DCS). We target the application domain of adaptive and reconfigurable systems: our language can serve programming closed-loop adaptation controllers, enabling flexible execution of functionalities w.r.t. changing resource and environment conditions. DCS is integrated into a1 programming language compiler, which facilitates its use by users and programmers, performing executable code generation. The tool is concretely built upon the basis of a reactive programming language compiler, where the nodes describe behaviors that can be modeled in terms of transition systems. Our compiler integrates this with a DCS tool, making it a new environment for formal methods. We define the trace semantics of our contracts language, describe its compilation and establish its correctness, and discuss implementation and examples.

Logico-numerical control for software components reconfiguration

“…We approach this problem under the angle of Discrete Event Systems (DES), involving properties on events observed during the execution, like requests of computing tasks or work overload, and a state space representing different configurations such as activity or assemblies of components. We build upon previous work on this topic where we explored the integration of reactive languages and tools for the design of controllers, including an application of Discrete Controller Synthesis (DCS) in a particular tool-supported approach using BZR [3,4]. We have recently defined and implemented Ctrl-F, a high-level language for the specification of reconfiguration behaviors in component-based systems [5].…”

“…Heptagon/BZR [3,4] (BZR in the following) is a reactive data-flow language where programs are built as parallel and hierarchical compositions of data-flow nodes, each having input and output flows. The body of a node describes how input flows are transformed into output flows, in the form of a set of equations and/or automata.…”

“…This boils down to limit the difference between the current input value of λ and its value at the previous instant. The discrete controller synthesis is then now performed by assuming that the predicate |pre λ − λ| < δ λ (4) always holds for some constant δ λ ∈ R + . Additional basic assumptions can be made on the measured workload that lead to further restricting its domain of values considered realistic using the predicate…”

Discrete Controller Synthesis for Infinite State Systems with ReaX

“…Our goal is to synthesize executable controllers; also, to integrate more easily in the BZR tool-suit (Delaval et al, 2013), it would be convenient to be able to produce actual programs not relying on a run-time constraints solver interpreting the controller. Besides, and on an even more practical level, existing libraries implementing operations on numerical abstract domains do not provide commodious means to universally quantify variables on abstract values.…”

“…The control of finite synchronous programs handling only Boolean variables has been subject to several studies (Marchand and Samaan, 2000; and there exists a tool Sigali implementing this theory. This tool is integrated in the BZR environment (Delaval et al, 2010(Delaval et al, , 2013, as part of a compiler of reactive synchronous programs with contracts.…”