Extending Lustre with Timeout Automata

Research output: Contribution to journalArticlepeer-review

Abstract

This paper describes an extension to Lustre to support the analysis of globally asynchronous, locally synchronous (GALS) architectures. This extension consists of constructs for directly specifying the timeout automata used to describe asynchronous communication between processes represented by Lustre nodes. It is implemented using an extensible language framework based on attribute grammars that allows such extensions to be modularly defined so that they may be more easily composed with other language extensions.

Original languageEnglish (US)
Pages (from-to)111-124
Number of pages14
JournalElectronic Notes in Theoretical Computer Science
Volume203
Issue number4
DOIs
StatePublished - Jun 5 2008

Bibliographical note

Funding Information:
1 This work is partially funded by NSF CAREER Award #0347860, NSF CCF Award #0429640, and the McKnight Foundation. 2 Email: jgao@cs.umn.edu 3 Email: mwwhalen@rockwellcollins.com 4 Email: evw@cs.umn.edu

Keywords

  • attribute grammars
  • composable language extensions
  • extensible languages
  • synchronous languages

Fingerprint Dive into the research topics of 'Extending Lustre with Timeout Automata'. Together they form a unique fingerprint.

Cite this