Abstraction Techniques for Compositional State-Based Scheduling Analysis

@article{Gezgin2012AbstractionTF,
  title={Abstraction Techniques for Compositional State-Based Scheduling Analysis},
  author={Tayfun Gezgin and Stefan Henkler and Achim Rettberg and Ingo Stierand},
  journal={2012 Brazilian Symposium on Computing System Engineering},
  year={2012},
  pages={166-171}
}
Nowadays, most embedded safety critical systems have to work in a timely manner in order to deliver desired services. In such timed systems not only ordering of events but timing properties are relevant for correctness and performance. In order to be safe and reliable, it is important to have rigorous analysis techniques of timing-dependent (state) behavior. Classical scheduling approaches consider only the system behavior stateless. Especially for safety critical systems this is not sufficient… 

Figures from this paper

State-based scheduling analysis for distributed real-time systems

This work considers the full state space of a system, where all interleavings and task dependencies are preserved, and introduces operations on the state spaces of resources, allowing the abstraction of irrelevant parts and the composition of state spaces.

State-based scheduling analysis for distributed real-time systems

This work considers the full state space of a system, where all interleavings and task dependencies are preserved, and introduces operations on the state spaces of resources, allowing the abstraction of irrelevant parts and the composition of state spaces.

State-based timing analysis for distributed systems

In this thesis a state-based approach for the analysis of timing constraints is introduced and an impact analysis approach is introduced to minimize re-verification efforts of timing properties.

Contracts for evolving systems

This work addresses evolving systems, which are basically collaborative and distributed systems building up a larger scale system of system (SoS) and proposes a well-defined modelling approach for SoS capturing both static and dynamic aspects.

Utilising Abstration Techniques and Gaming Theory for Developing Intangible Cultural Heritage

The proposed approach is to formulate element and standard, enabling system automation to integrate and verify the flow of abstraction level and to instantiate and infer the other values with the same concrete information and game rate.

Developing a Creative Travel Management System Based on Software Reuse and Abstraction Techniques

This paper demonstrates a new system, aiming to generate creative travel plans, relying on software reuse and abstraction techniques, to reuse different elements from different travel components to comprise a creative travel plan.

Applying patterns in embedded systems design for managing quality attributes and their trade-offs

It is suggested that, when applicable, design patterns can promote CQAs while supporting the management of trade-offs, and factors that can influence the extent of the observed benefits.

References

SHOWING 1-10 OF 17 REFERENCES

Timed automata based analysis of embedded system architectures

It is shown that timed automata can be used to model and to analyze timeliness properties of embedded system architectures and that if the state space of the model is tractable, Uppaal gives the most accurate results at similar cost.

Timed Automata with Asynchronous Processes: Schedulability and Decidability

This paper exend timed automata with asynchronous processes i.e. tasks triggered by events as a model for real-time systems and achieves the first general decidability result on dense-time models for real time scheduling without assuming that preemptions occur only at integer time points.

The symbolic model-checking for real-time systems

  • S. Yamane
  • Computer Science
    Proceedings of the Eighth Euromicro Workshop on Real-Time Systems
  • 1996
This work has realized an effective symbolic model checker based on BDD in dense time model with the proposed method and represents state spaces by both BDD and DBM (Difference Bound Matrices).

Holistic schedulability analysis for distributed hard real-time systems

Timing Assumptions and Verification of Finite-State Concurrent Systems

  • D. Dill
  • Computer Science, Mathematics
    Automatic Verification Methods for Finite State Systems
  • 1989
A scheme that allows timing assumptions to be incorporated into automatic proofs of arbitrary finite-state temporal properties is described, and it is conjecture that the method presented can be extended in this way.

A Theory of Timed Automata

Timed Automata: Semantics, Algorithms and Tools

This chapter presents the concrete and abstract semantics of timed automata (based on transition rules, regions and zones), decision problems, and algorithms for verification, and a detailed description on DBM (Difference Bound Matrices) is included.

Exploiting inter-event stream correlations between output event streams of non-preemptively scheduled tasks

  • J. RoxR. Ernst
  • Computer Science
    2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010)
  • 2010
A new technique is presented which allows capturing timing-correlations between the output event streams of tasks resulting from the use of a non-preemptive scheduling policy on a resource and it is shown how these timing-Correlations can be exploited to calculate tighter bounds for the worst-case response time analysis for tasks activated by such correlated event streams.

Real-time calculus for scheduling hard real-time systems

  • L. ThieleS. ChakrabortyM. Naedele
  • Computer Science
    2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353)
  • 2000
A link between three areas, namely Max-Plus Linear System Theory as used for dealing with certain classes of discrete event systems, Network Calculus for establishing time bounds in communication networks, and real-time scheduling is established.

Embedded Software in Network Processors - Models and Algorithms

A task model for embedded systems operating on packet streams, such as network processors, allows a unified treatment of several problems arising in the network packet processing domain such as packet scheduling, task scheduling and architecture/algorithm explorations in the design of network processors.