#### Filter Results:

- Full text PDF available (54)

#### Publication Year

1969

2013

- This year (0)
- Last 5 years (1)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- NICHOLAS HALBWACHS, PAUL CASPI, DANIEL PILAUD
- 2004

This paper describes the language LUSTRE which is a data flow synchronous language, designed for programming reactive systems-uch as automatic control and monitoring sy s t emsas well as for describing hardware. The data flow aspect of LUSTRE makes it very close to usual description tools in these domains (blockdiagrams, networks of operators, dynamical… (More)

- Paul Caspi, Daniel Pilaud, Nicolas Halbwachs, John Plaice
- POPL
- 1987

LUSTRE is a synchronous data-flow language for programming systems which interact with their environments in real-time. After an informal presentation of the language, we describe its semantics by means of structural inference rules. Moreover, we show how to use this semantics in order to generate efficient sequential code, namely, a finite state automaton… (More)

- Albert Benveniste, Paul Caspi, Stephen A. Edwards, Nicolas Halbwachs, Paul Le Guernic, Robert de Simone
- Proceedings of the IEEE
- 2003

Twelve years ago, PROCEEDINGS OF THE IEEE devoted a special section to the synchronous languages. This paper discusses the improvements, difficulties, and successes that have occured with the synchronous languages since then. Today, synchronous languages have been established as a technology of choice for modeling, specifying, validating, and implementing… (More)

Twelve years ago, Proceedings of the IEEE devoted a special section to the synchronous languages. This article discusses the improvements, difficulties, and successes that have occured with the synchronous languages since then. Today, synchronous languages have been established as a technology of choice for modeling, specifying, validating, and implementing… (More)

- Paul Caspi, Marc Pouzet
- ICFP
- 1996

Synchronous data-flow is a programming paradigm which has been successfully applied in reactive systems. In this context, it can be characterized as some class of static bounded memory data-flow networks. In particular, these networks are not recursively defined, and obey some kind of "synchronous" constraints (<i>clock calculus</i>). Based on Kahn's… (More)

- Eugene Asarin, Paul Caspi, Oded Maler
- LICS
- 1997

In this paper we define timed regular expressions, an extension of regular expressions for specifying sets of densetime discrete-valued signals. We show that this formalism is equivalent in expressive power to the timed automata of Alur and Dill by providing a translation procedure from expressions to automata and vice versa. The result is extended to… (More)

We present a layered end-to-end approach for the design and implementation of embedded software on a distributed platform. The approach comprises a high-level modeling and simulation layer (Simulink), a middle-level programming and validation layer (SCADE/Lustre) and a low-level execution layer (TTA). We provide algorithms and tools to pass from one layer… (More)

- Paul Caspi, Adrian Curic, Aude Maignan, Christos Sofronis, Stavros Tripakis
- EMSOFT
- 2003

We present a method of translating discrete-time Simulink models to Lustre programs. Our method consists of three steps: type inference, clock inference, and hierarchical bottom-up translation. In the process, we explain and formalize the typing and timing mechanisms of Simulink. The method has been implemented in a prototype tool called S2L, which has been… (More)

- Eugene Asarin, Paul Caspi, Oded Maler
- J. ACM
- 2002

In this article, we define <i>timed regular expressions</i>, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivalent to the <i>timed automata</i> of Alur and Dill. This result is the timed analogue of Kleene Theorem and, similarly to that result, the hard part in the proof is the… (More)

- Christos Sofronis, Stavros Tripakis, Paul Caspi
- EMSOFT
- 2006

Recently, we have proposed a set of buffering schemes to preserve the semantics of a synchronous program when the latter is implemented as a set of multiple tasks running under preemptive scheduling. These schemes, however, are not optimal in terms of memory (buffer usage). In this paper we propose a new protocol which generalizes the previous schemes. The… (More)