Skip to Main content Skip to Navigation
New interface
Conference papers

Symbolic Simulation of Dataflow Synchronous Programs with Timers

Guillaume Baudart 1 Timothy Bourke 2, 3 Marc Pouzet 2, 3, 4 
3 Parkas - Parallélisme de Kahn Synchrone
DI-ENS - Département d'informatique - ENS Paris, CNRS - Centre National de la Recherche Scientifique, Inria de Paris
Abstract : The synchronous language Lustre and its descendants have long been used to program and model discrete controllers. Recent work shows how to mix discrete and continuous elements in a Lustre-like language called Zélus. The resulting hybrid programs are deterministic and can be simulated with a numerical solver. In this article, we focus on a subset of hybrid programs where continuous behaviors are expressed using timers, nondeterministic guards, and invariants, as in Timed Safety Automata. We propose a source-to-source compilation pass to generate discrete code that, coupled with standard operations on Difference-Bound Matrices, produces symbolic traces that each represent a set of concrete traces.
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download
Contributor : Timothy Bourke Connect in order to contact the contributor
Submitted on : Friday, January 11, 2019 - 4:54:12 PM
Last modification on : Friday, November 18, 2022 - 9:24:33 AM


Files produced by the author(s)



Guillaume Baudart, Timothy Bourke, Marc Pouzet. Symbolic Simulation of Dataflow Synchronous Programs with Timers. 12th Forum on Specification and Design Languages (FDL 2017), Electronic Chips & System Design Initiative (ECSI), Sep 2017, Vérone, Italy. pp.25, ⟨10.1007/978-3-030-02215-0_3⟩. ⟨hal-01575621v4⟩



Record views


Files downloads