Abstract
We study a graph-based real-time task model in which inter-task synchronization can be specified through a rendezvous mechanism. Previously, efficient methods have been proposed for timing analysis of the corresponding task sets. In this paper, we first formally specify an operational semantics for the model. Next, we describe a method for Ada code generation for a set of such task graphs. We also specify extensions of the approach to cover a notion of broadcasting, as well as global inter-release separation time of real-time jobs. We have implemented the proposed method in a graphical tool which facilitates a model-based design and implementation of real-time software.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Recall that \(c_i\) and \(\sigma _i\) denote the i-th entries of \(\bar{c}\) and \(\bar{\sigma }\), respectively.
- 2.
We use goto to avoid lengthy and redundant codes. The same logic can be easily implemented without this statement.
- 3.
The tool is not publicly released at the moment of writing this work. A primary version is available at http://user.it.uu.se/~mormo492/TimesPro.zip.
References
Abdullah., J., Mohaqeqi, M., Yi, W.: Synthesis of Ada code from graph-based task models. In: 32nd Symposium on Applied Computing, pp. 1466–1471 (2017)
Amnell, T., Fersman, E., Pettersson, P., Yi, W., Sun, H.: Code synthesis for timed automata. Nordic J. Comput. 9(4), 269–300 (2002)
Amnell, T., Fersman, E., Mokrushin, P., Pettersson, Yi, W.: TIMES - a tool for modelling and implementation of embedded systems. In: 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp. 460–464 (2002)
Sanjoy, K.B.: The non-cyclic recurring real-time task model. In: Real-Time Systems Symposium (RTSS), pp. 173–182 (2010)
Fersman, E., Krcal, P., Pettersson, P., Yi, W.: Task automata: schedulability, decidability and undecidability. J. Inf. Comput. 205(8), 1149–1172 (2007)
Kim, B., Feng, L., Sokolsky, O., Lee, I.: Platform-specific code generation from platform-independent timed models. In: Real-Time Systems Symposium (RTSS), pp. 75–86 (2015)
Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46–61 (1973)
McCormick, J.W., Singhoff, F., Hugues, J.: Building Parallel, Embedded, and Real-Time Applications with Ada. Cambridge University Press, Cambridge (2011)
Mohaqeqi, M., Abdullah, J., Guan, N., Yi, W.: Schedulability analysis of synchronous digraph real-time tasks. In: 28th Euromicro Conference on Real-Time Systems (ECRTS), pp. 176–186 (2016)
Real, J., Sáez, S., Crespo, A.: Combining time-triggered plans with priority scheduled task sets. In: 21st Ada-Europe International Conference on Reliable Software Technologies, pp. 195–212 (2016)
Stigge, M., Ekberg, P., Guan, N., Yi, W.: The digraph real-time task model. In: 17th IEEE Real-Time and Embedded Technology and Applications Symposium, pp. 71–80 (2011)
Stigge, M.: Real-time workload models: expressiveness vs. analysis efficiency. Ph.D. thesis, Uppsala University (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Mohaqeqi, M., Abdullah, J., Yi, W. (2017). An Executable Semantics for Synchronous Task Graphs: From SDRT to Ada. In: Blieberger, J., Bader, M. (eds) Reliable Software Technologies – Ada-Europe 2017. Ada-Europe 2017. Lecture Notes in Computer Science(), vol 10300. Springer, Cham. https://doi.org/10.1007/978-3-319-60588-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-60588-3_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-60587-6
Online ISBN: 978-3-319-60588-3
eBook Packages: Computer ScienceComputer Science (R0)