Results 1  10
of
12
Implementation of the Dataflow Synchronous Language SIGNAL
 In Conference on Programming Language Design and Implementation
, 1995
"... This paper presents the techniques used for the compilation of the dataflow, synchronous language SIGNAL. The key feature of the compiler is that it performs formal calculus on systems of boolean equations. The originality of the implementation of the compiler lies in the use of a tree structure to ..."
Abstract

Cited by 28 (9 self)
 Add to MetaCart
This paper presents the techniques used for the compilation of the dataflow, synchronous language SIGNAL. The key feature of the compiler is that it performs formal calculus on systems of boolean equations. The originality of the implementation of the compiler lies in the use of a tree structure to solve the equations. 1 Introduction Traditionally, realtime systems have been programmed in imperative asynchronous languages like ADA, OCCAM or C together with some operating system facilities. But these tools are not satisfactory as there is considerable need of provably correct software and as systems become more and more complex. To remedy the insufficiencies of the current tools, the synchronous paradigm has been proposed and developed in[4]. Its main hypothesis is that a) operators react instantaneously with their inputs (computations have zero duration), b) time is just a succession of events (no explicit reference to a notion of physical time). The validity of the synchrony assu...
On the Optimal Control of Polynomial Dynamical Systems over Z/pZ
 In 4th International Workshop on Discrete Event Systems
, 1998
"... This paper describes how a polynomial equationnal approach of the theory of logic discrete event systems leads to efficient algorithms for the synthesis of supervisory controllers. Even if traditional control objectives can be considered in our framework (invariance, reachability or attractivity), w ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
This paper describes how a polynomial equationnal approach of the theory of logic discrete event systems leads to efficient algorithms for the synthesis of supervisory controllers. Even if traditional control objectives can be considered in our framework (invariance, reachability or attractivity), we address here the synthesis of optimal controller with control objectives specified as a minimization of a given cost function over the states through the trajectories of the system.
The Token Flow Model
, 1992
"... This paper reviews and extends an analytical model for the behavior of dataflow graphs with datadependent control flow. The number of tokens produced or consumed by each actor is given as a symbolic function of the Booleans in the system. Longterm averages can be analyzed to determine consistency ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
This paper reviews and extends an analytical model for the behavior of dataflow graphs with datadependent control flow. The number of tokens produced or consumed by each actor is given as a symbolic function of the Booleans in the system. Longterm averages can be analyzed to determine consistency of token flow rates. Shortterm behavior can be analyzed to construct an annotated schedule, or a static schedule that annotates each firing of an actor with the Boolean conditions under which that firing occurs. Necessary and sufficient conditions for boundedlength schedules, as well as sufficient conditions for determining that a dataflow graph can be scheduled in bounded memory are given. Annotated schedules can be used to generate efficient implementations of the algorithms described by the dataflow graphs. 1. Introduction The principal strength of dataflow graphs is that they do not overspecify an algorithm by imposing unnecessary sequencing constraints between operators. Instead, th...
Partial Order Control of Discrete Event Systems modeled as Polynomial Dynamical Systems
 In 1998 IEEE International Conference On Control Applications
, 1998
"... In this paper, we address computational methods for the synthesis of controllers for discrete event systems modeled as polynomial dynamical systems over ZZ= 3ZZ . The control objectives are specified as order relations to be checked by the system. The control objectives equations are then synthesi ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
In this paper, we address computational methods for the synthesis of controllers for discrete event systems modeled as polynomial dynamical systems over ZZ= 3ZZ . The control objectives are specified as order relations to be checked by the system. The control objectives equations are then synthesized using algebraic tools. The applications of these methods to the safety specification of a power transformer station controller is presented. Keywords : Control Synthesis, Polynomial Dynamical System, Order Relations, Power systems. 1 Introduction The control theory of discrete event systems (DES) introduced by [1] is based on formal languages and automata. The DES are described in terms of prefixclosed language; each element of the alphabet representing a possible event. The control of the plant is then performed by inhibiting some events (controllable events) while the other events (uncontrollable events) can not be prevented from occuring. In our framework, the specification of the...
Some synchronization issues when designing embedded systems from components
 In Proc. of 1st Int. Workshop on Embedded Software, EMSOFT’01, T.A. Henzinger and C.M. Kirsch Eds., LNCS 2211, 32–49
, 2001
"... from components ..."
Validation of Mixed SignalAlpha RealTime Systems through Affine Calculus on Clock Synchronisation Constraints
 In World Congress on Formal Methods (2
, 1999
"... . In this paper we present the affine clock calculus as an extension of the formal verification techniques provided by the Signal language. A Signal program describes a system of clock synchronisation constraints the consistency of which is verified by compilation (clock calculus) . Welladapted ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
. In this paper we present the affine clock calculus as an extension of the formal verification techniques provided by the Signal language. A Signal program describes a system of clock synchronisation constraints the consistency of which is verified by compilation (clock calculus) . Welladapted in controlbased system design, the clock calculus has to be extended in order to enable the validation of SignalAlpha applications which usually contain important numerical calculations. The new affine clock calculus is based on the properties of affine relations induced between clocks by the refinement of SignalAlpha specifications in a codesign context. Affine relations enable the derivation of a new set of synchronisability rules which represent conditions against which synchronisation constraints on clocks can be assessed. Properties of affine relations and synchronisability rules are derived in the semantical model of traces of Signal. A prototype implementing a subset of t...
Modelling of Complex Software Systems: a Reasoned Overview
"... This paper is devoted to the presentation of the key concepts on which a mathematical theory of complex (industrial) systems can be based. We especially show how this formal framework can capture the realness of modern information technologies. We also present some new modelling problems that are na ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
This paper is devoted to the presentation of the key concepts on which a mathematical theory of complex (industrial) systems can be based. We especially show how this formal framework can capture the realness of modern information technologies. We also present some new modelling problems that are naturally emerging in the specific context of complex software systems.