Specification and analysis of synchronous reactions

Abstract.Development environments based on the synchronous paradigm do not offer many validation tools dedicated to numerical aspects, while various techniques are well known. Actually it appears that in the most general case models are extended with a special value that makes explicit the absence of discrete events at a given instant, which prevents from directly taking advantage of existing methods. This paper deals with absence handling in the context of the synchronous paradigm. With this focus it first surveys the main languages and stresses the importance of clocks, then it discusses our “Clock Language” that makes possible the handling of numerical aspects without explicit absence.

[1]  Gilles Kahn,et al.  The Semantics of a Simple Language for Parallel Programming , 1974, IFIP Congress.

[2]  Éric Rutten,et al.  Formal Verification of SIGNAL Programs: Application to a Power Transformer Station Controller , 1996, AMAST.

[3]  Paul Le Guernic,et al.  For a New Real-Time Methodology , 1994 .

[4]  Mirabelle Nebut,et al.  An Overview of the Signal Clock Calculus , 2004, SLAP.

[5]  Paul Le Guernic,et al.  Implementation of the data-flow synchronous language SIGNAL , 1995, PLDI '95.

[6]  Cécile Dumas Canovas.  Méthodes déductives pour la preuve de programmes LUSTRE , 2000 .

[7]  Paul Caspi,et al.  Embedded Control: From Asynchrony to Synchrony and Back , 2001, EMSOFT.

[8]  Nicolas Halbwachs,et al.  About Synchronous Programming and Abstract Interpretation , 1998, Sci. Comput. Program..

[9]  Jean-Pierre Talpin,et al.  Co-inductive Axiomatization of a Synchronous Language , 1998, TPHOLs.

[10]  Charles André.  Representation and Analysis of Reactive Behaviors: A Synchronous Approach , 2000 .

[11]  Albert Benveniste,et al.  programmi language and its , 2001 .

[12]  Cécile Canovas,et al.  A PVS Proof Obligation Generator for Lustre Programs , 2000, LPAR.

[13]  Pascal Raymond,et al.  Compilation efficace d'un langage déclaratif synchrone : le générateur de code Lustre-V3. (Efficient Compilation of a Declarative Synchronous Language:the Lustre-V3 Code Generator) , 1991 .

[14]  Yves Sorel,et al.  A Denotational Theory of Synchronous Reactive Systems , 1992, Inf. Comput..

[15]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[16]  Thierry Gautier,et al.  Programming real-time applications with SIGNAL , 1991, Proc. IEEE.

[17]  Michael Mendler,et al.  Towards a Model-Theory for Esterel , 2002, SLAP@ETAPS.

[18]  Nicolas Halbwachs,et al.  Programming and Verifying Real-Time Systems by Means of the Synchronous Data-Flow Language LUSTRE , 1992, IEEE Trans. Software Eng..

[19]  Gérard Berry,et al.  The foundations of Esterel , 2000, Proof, Language, and Interaction.

[20]  Jean-Pierre Talpin,et al.  Polyhedral Analysis for Synchronous Languages , 1999, SAS.

[21]  N. Halbwachs,et al.  Synchronous programming of reactive systems: A tutorial and commented bibliography , 1998, CAV 1998.

[22]  Nicolas Halbwachs,et al.  Synchronous Programming of Reactive Systems , 1992, CAV.

[23]  Gérard Berry,et al.  The Esterel Synchronous Programming Language: Design, Semantics, Implementation , 1992, Sci. Comput. Program..

[24]  L. D. Moura.  Lemmas on Demand for Satisfiability Solvers , 2002 .

[25]  Joaquín Aguado,et al.  A-maze-ing Esterel , 2004, Electron. Notes Theor. Comput. Sci..

[26]  Marc Pouzet,et al.  Synchronous Kahn networks , 1996, ICFP '96.

[27]  Benoît Caillaud,et al.  From Synchrony to Asynchrony , 1999, CONCUR.

[28]  Stephen A. Edwards,et al.  The Synchronous Languages Twelve Years Later , 1997 .

[29]  Bertrand Jeannet,et al.  Dynamic Partitioning in Linear Relation Analysis. Application to the Verification of Synchronous Programs , 2000 .

[30]  Hassen Saïdi,et al.  Construction of Abstract State Graphs with PVS , 1997, CAV.

[31]  Mirabelle Nebut,et al.  Réactions synchrones : spécification et analyse , 2002 .

[32]  Sophie Pinchinat,et al.  A Decidable Clock Language for Synchronous Specifications , 2002, Electron. Notes Theor. Comput. Sci..

[33]  Tocheou Amagbegnon,et al.  Forme canonique arborescente des horloges de signal , 1995 .

[34]  David Nowak,et al.  Synchronous structures , 1999, Inf. Comput..

[35]  Pascal Raymond,et al.  The synchronous data flow programming language LUSTRE , 1991, Proc. IEEE.

[36]  Richard Gerber,et al.  Composite model-checking: verification with type-specific symbolic representations , 1999, TSEM.