Symbolic Simulation of Dataflow Synchronous Programs with Timers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Symbolic Simulation of Dataflow Synchronous Programs with Timers

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.
Fichier principal
Vignette du fichier
fdl_journal18.pdf (257.2 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01575621 , version 1 (21-08-2017)
hal-01575621 , version 2 (19-09-2017)
hal-01575621 , version 3 (01-12-2017)
hal-01575621 , version 4 (11-01-2019)

Identifiers

Cite

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⟩
415 View
344 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More