Upper Bound for Delay Densities

DSpace Repository


Dateien:
Aufrufstatistik

URI: http://hdl.handle.net/10900/84297
http://nbn-resolving.de/urn:nbn:de:bsz:21-dspace-842970
http://dx.doi.org/10.15496/publikation-25687
Dokumentart: InProceedings (Aufsatz / Paper einer Konferenz etc.)
Date: 2018-03-13
Language: English
Faculty: 7 Mathematisch-Naturwissenschaftliche Fakultät
Department: Informatik
DDC Classifikation: 004 - Data processing and computer science
Keywords: Regelungssystem
Other Keywords:
networked control systems
worst case response time
delay densities
Real-Time-Calculus
ISBN: 978-3-00-059317-8
License: Publishing license excluding print on demand
Show full item record

Abstract:

In networked control systems, sensors and actuators are connected via networks to the controller platform. Contrary to direct links, delays vary in a more or less wide range in network links. Hence, delays are one of the key issues in the design process of a networked control system. Therefore, obtaining safe upper bounds is essential to guarantee the desired behavior of the system. On the other hand, the bounds should be as tight as possible. Large overestimations result in over-dimensioned platforms and networks. A common approach is to assume the occurrence of the worst case response time (WCRT) for all transmissions. This simplifies the design process as the WCRT can be derived directly from the platform model. Though, it contains inherently large overestimations. A more accurate approach is featured by delay densities. By not treating each event individually, delay densities give a description of the timing behavior within intervals. Additionally, the method is not limited to strictly periodic events. In this paper, we propose a method for deriving an upper bound from a platform description in Real-Time-Calculus.

This item appears in the following Collection(s)