Abstract
The approach proposed in this paper forms the front-end of a framework for the complete design flow from specification models of new automotive functions captured in Matlab Simulink to their distributed execution on hierarchical bus-based electronic architectures hosting the release of already deployed automotive functions. The process starts by deriving a task structure from a given Matlab Simulink model. Because the obtained network is typically unbalanced in the sense of computational node weights, nodes are melted following an optimization metric called cohesion where nodes are attracted by high communication density and repelled by high node weights. This reduces task-switching times by avoiding too lightweight tasks and relieves the bus by keeping inter-task communication low. This so-called Task Creation encloses the translation of the synchronous block diagram model of Simulink into a message-based task network formalism that serves as semantic base.
This work was supported by the German Research Council (DFG) as part of the Transregional Collaborative Research Center SFB/TR 14 AVACS.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126, 183–235 (1994)
Bao, J., Battram, P., Enkelmann, A., Gabel, A., Heyen, J., Koepke, T., Läsche, C., Sieverding, S.: Projektgruppe ViDAs - Endbericht (2010)
Büker, M., Damm, W., Ehmen, G., Metzner, A., Stierand, I., Thaden, E.: Automating the design flow for distributed embedded automotive applications: keeping your time promises, and optimizing costs, too. Technical Report 69, SFB/TR 14 AVACS (2011)
Büker, M., Metzner, A., Stierand, I.: Testing real-time task networks with functional extensions using model-checking. In: Proc. ETFA (2009)
Caspi, P., Curic, A., Maignan, A., Sofronis, C., Tripakis, S., Niebert, P.: From simulink to scade/lustre to tta: a layered approach for distributed embedded applications. In: Proc. ACM SIGPLAN, LCTES (2003)
Di Natale, M., Guo, L., Zeng, H., Sangiovanni-Vincentelli, A.: Synthesis of multitask implementations of simulink models with minimum delays. IEEE Transactions on Industrial Informatics (2010)
Ferdinand, C.: Worst-case execution time prediction by static program analysis. In: Proc. IPDPS (2004)
Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: Proc. DAC 1982, pp. 175–181 (1982)
Jersak, M., Richter, K., Ernst, R.: Performance Analysis for Complex Embedded Applications. International Journal of Embedded Systems, Special Issue on Codesign for SoC (2004)
Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal 49(1) (1970)
Kugele, S., Haberl, W.: Mapping data-flow dependencies onto distributed embedded systems. In: Proc. of SERP 2008 (2008)
Lublinerman, R., Tripakis, S.: Modular code generation from triggered and timed block diagrams. In: IEEE Real-Time and Embedded Technology and Applications Symposium, vol. 0, pp. 147–158 (2008)
Pouzet, M., Raymond, P.: Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation. In: Proc. of EMSOFT (2009)
Rox, J., Ernst, R.: Construction and Deconstruction of Hierarchical Event Streams with Multiple Hierarchical Layers. In: Proc. ECRTS (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Büker, M., Damm, W., Ehmen, G., Stierand, I. (2011). An Automated Semantic-Based Approach for Creating Tasks from Matlab Simulink Models. In: Salaün, G., Schätz, B. (eds) Formal Methods for Industrial Critical Systems. FMICS 2011. Lecture Notes in Computer Science, vol 6959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24431-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-24431-5_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24430-8
Online ISBN: 978-3-642-24431-5
eBook Packages: Computer ScienceComputer Science (R0)