2009 Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition 2009
DOI: 10.1109/date.2009.5090639
|View full text |Cite
|
Sign up to set email alerts
|

WCRT algebra and interfaces for esterel-style synchronous processing

Abstract: Abstract-The synchronous model of computation together with a suitable execution platform facilitates system-level timing predictability. This paper introduces an algebraic framework for precisely capturing worst case reaction time (WCRT) characteristics for Esterel-style reactive processors with hardware-supported multithreading. This framework provides a formal grounding for the WCRT problem, and allows to improve upon earlier heuristics by accurately and modularly characterizing timing interfaces.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
21
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(21 citation statements)
references
References 21 publications
(43 reference statements)
0
21
0
Order By: Relevance
“…The algebraic formulation of [19] for Esterel is closest to our approach. However, this does not consider the issue of tick alignment and signal dependencies.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…The algebraic formulation of [19] for Esterel is closest to our approach. However, this does not consider the issue of tick alignment and signal dependencies.…”
Section: Related Workmentioning
confidence: 99%
“…Following the terminology of [19] we distinguish two types of execution paths in an IO-BTCA. A sink path starts in entry(A), passes through immediate transitions ends in a pause state.…”
Section: Illustrative Sccharts Examplementioning
confidence: 99%
See 1 more Smart Citation
“…Mendler et al [20] propose an algebraic approach for the WCRT analysis for Esterel programs. Raymond et al [25] have been concerned with infeasible paths in the binary code under timing analysis that are implied by high-level functional properties given in synchronous languages, the concrete language in their design being the dataflow language Lustre [5].…”
Section: Related Workmentioning
confidence: 99%
“…Boldt et al [29] propose a flow-based method for WCRT analysis of Esterel programs running on a reactive processor with fully predictable timing [30]; the WCRT analysis results are then used to annotate a program with timing annotations that the processor uses to check timing overruns due to hardware failures. Mendler et al [31] propose an algebraic approach for the WCRT analysis for Esterel programs running on a reactive processor. Raymond et al [32] propose an approach to improve WCET analysis by checking feasibility of computed longest paths using model checking at the modeling level.…”
Section: Related Workmentioning
confidence: 99%