Time for Reactive System Modeling

Fuhrmann, Insa; Broman, David; Hanxleden, Reinhard von; Schulz-Rosengarten, Alexander

doi:10.1145/2997465.2997467

Cited by 6 publications

(12 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition to the discussed advantages, this approach is compatible with the definition in [FBH+16], as its condition clearly holds there due to the restriction to simple ITAGs in which no TPP might occur twice in a path, as loops may not contain TPPs. Figure 6.8 shows a section of an ITAG with a simple loop.…”

Section: Tpp Placement In Loops and Related Timing Valuesmentioning

confidence: 91%

“…This makes it difficult to generally define the semantics of a request for the timing value between two program points, unless both of them are placed outside the loop structure. This is the reason for the restriction in [FBH+16], where we confine TPP placement by demanding that the derived TPPG for an ITAG has to be a DAG. However, this restriction is not mandatory.…”

Section: Tpp Placement and Loopsmentioning

confidence: 99%

“…Section 6.10.1 contains the basic interface definition adapted from the publications [FBS+14a;FBS+14b;FBH+16], which are presented in more detail in the introduction. In Section 6.10.2, I suggest an expansion of the interface definition to accommodate general ITAG structures, i.e.…”

Section: Interactive Timing Interfacementioning

confidence: 99%

“…Royal Institute of Stockholm, who engaged in the analysis tool perspective and in ongoing research develops a tool named KTA that satisfies the interface. In the course of our collaboration, he has implemented a simple experimental version of the tool to enable the evaluation of the interface [FBH+16]. This experimental tool is available under the MIT license 5 .…”

Section: Time For Scchartsmentioning

confidence: 99%

“…Thus, the tested models are restricted to models with boolean input and no more than 20 input variables. On the other hand, the retrieved timing values can be a useful comparison set for the assessment of the finished timing analysis tool version and, not regarding compiler optimizations, present a tight timing estimation for the interactive timing analysis validation, as the simulation is cycleaccurate [FBH+16]. A possible introduction of overestimation due to the implemented approach to TPP semantics is explained in Section 7.5.…”

Section: Time For Scchartsmentioning

confidence: 99%

See 4 more Smart Citations

Time for Reactive System Modeling

Fuhrmann¹

View full text Add to dashboard Cite

Reactive systems interact with their environment by reading inputs and computing and feeding back outputs in reactive cycles that are also called ticks. Often they are safety critical systems and are increasingly modeled with highlevel modeling tools. The concepts of the corresponding modeling languages are typically aimed to facilitate formal reasoning about program constructiveness to guarantee deterministic output and are explicitly abstracted from execution time aspects. Nevertheless, the worst-case execution time of a tick can be a crucial value, as it decides the frequency in which the system can interact with its surroundings. An excessive tick Worst Case Execution Time (WCET) can lead to lost inputs or tardy reaction to critical events. Thus, the modeler has to make sure that the timing behaviour of the system under development meets the specifications. This thesis proposes a general approach to interactive timing analysis, which enables the feedback of detailed timing values directly in the model representation to support timing aware modeling. The concept is based on a generic timing interface that enables the exchangeability of the modeling as well as the timing analysis tool for the flexible implementation of varying tool chains. This aims at enhancing the comparability of tools and facilitates the sharing of benchmark model suites. The introduced approach is applicable not only to dataflow-based systems, but also to state-based systems. The latter is enabled by a concept for communicating analysis requests and responses for arbitrary code parts instead of a restriction to function granularity. The proposed timing analysis approach includes visual highlighting and modeling pragmatics features to guide the user to WCET hotspots for timing related model revisions. The approach is practically evaluated with an open-source Eclipse-based example implementation for the modeling language SCCharts, which includes a user study.

show abstract

Section: Tpp Placement In Loops and Related Timing Valuesmentioning

confidence: 91%

Section: Tpp Placement and Loopsmentioning

confidence: 99%

Section: Interactive Timing Interfacementioning

confidence: 99%

Section: Time For Scchartsmentioning

confidence: 99%

Section: Time For Scchartsmentioning

confidence: 99%

See 3 more Smart Citations

Time for Reactive System Modeling

Fuhrmann¹

View full text Add to dashboard Cite

show abstract

Scalable and precise estimation and debugging of the worst-case execution time for analysis-friendly processors: a comeback of model checking

Becker¹,

Metta²,

Venkatesh³

et al. 2018

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

Estimating the Worst-Case Execution Time (WCET) of an application is an essential task in the context of developing real-time or safety-critical software, but it is also a complex and error-prone process. Conventional approaches require at least some manual inputs from the user, such as loop bounds and infeasible path information, which are hard to obtain and can lead to unsafe results if they are incorrect. This is aggravated by the lack of a comprehensive explanation of the WCET estimate, i.e., a specific trace showing how WCET was reached. It is therefore hard to spot incorrect inputs and hard to improve the worst-case timing of the application. Meanwhile, modern processors have reached a complexity that refutes analysis and puts more and more burden on the practitioner. In this article we show how all of these issues can be significantly mitigated or even solved, if we use processors that are amenable to WCET analysis. We define and identify such processors, and then we propose an automated tool set which estimates a precise WCET without unsafe manual inputs, and also reconstructs a maximum-detail view of the WCET path that can be examined in a debugger environment. Our approach is based on Model Checking, which however is known to scale badly with growing application size. We address this issue by shifting the analysis to source code level, where source code transformations can be applied that retain the timing behavior, but reduce the complexity. Our experiments show that fast and precise estimates can be achieved with Model Checking, that its scalability can even exceed current approaches, and that new opportunities arise in the context of "timing debugging".

show abstract

Compositional timing-aware semantics for synchronous programming

Aguado

Mendler

Wang

et al. 2017

2017 Forum on Specification and Design Languages (FDL)

View full text Add to dashboard Cite

In this paper we propose a WCRT analysis technique for synchronous programs, executed as sequential or multithreaded code, based on formal power series in min-max-plus algebra. The algebraic model constitutes the first fully declarative timing-aware semantics of synchronous programs with arbitrary hierarchical control-flow structure. Under signal abstraction this model permits efficient compositional WCRT analyses based on structural boxes as the unit of composition. The algebraic model leads to a sound methodology to deal with the state space explosion arising from tick alignment of parallel composition by reduction to the maximum weighted clique problem.

show abstract

Time for Reactive System Modeling

Cited by 6 publications

References 33 publications

Time for Reactive System Modeling

Time for Reactive System Modeling

Scalable and precise estimation and debugging of the worst-case execution time for analysis-friendly processors: a comeback of model checking

Compositional timing-aware semantics for synchronous programming

Contact Info

Product

Resources

About