Skip to main content
Erschienen in:
Buchtitelbild

2017 | OriginalPaper | Buchkapitel

Towards Customizable CPS: Composability, Efficiency and Predictability

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Today, many industrial products are defined by software, and therefore customizable by installing new applications on demand - their functionalities are implemented by software and can be modified and extended by software updates. This trend towards customizable products is extending into all domains of IT, including Cyber-Physical Systems (CPS) such as cars, robotics, and medical devices. However, these systems are often highly safety-critical. The current state-of-practice allows hardly any modifications once safety-critical systems are put in operation. This is due to the lack of techniques to preserve crucial safety conditions for the modified system, which severely restricts the benefits of software.
This work aims at new paradigms and technologies for the design and safe software updates of CPS at operation-time – subject to stringent timing constraints, dynamic workloads, and limited resources on complex computing platforms. Essentially there are three key challenges: Composability, Resource-Efficiency and Predictability to enable modular, incremental and safe software updates over system life-time in use. We present research directions to address these challenges: (1) Open architectures and implementation schemes for building composable systems, (2) Fundamental issues in real-time scheduling aiming at a theory of multi-resource (inc. multiprocessor) scheduling, and (3) New-generation techniques and tools for fully separated verification of timing and functional properties of real-time systems with significantly improved efficiency and scalability. The tools shall support not only verification, but also code generation tailored for both co-simulation (interfaced) with existing design tools such as Open Modelica (for modeling and simulation of physical components), and deployment on given computing platforms.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Abdullah, J., Dai, G., Guan, N., Mohaqeqi, M., Yi, W.: Towards a tool: times-pro for modeling, analysis, simulation and implementation of cyber-physical systems. In: Aceto, L., et al. (eds.) Larsen Festschrift. LNCS, vol. 10460, pp. 23–639. Springer, Heidelberg (2017). doi:10.1007/978-3-319-63121-9_31 Abdullah, J., Dai, G., Guan, N., Mohaqeqi, M., Yi, W.: Towards a tool: times-pro for modeling, analysis, simulation and implementation of cyber-physical systems. In: Aceto, L., et al. (eds.) Larsen Festschrift. LNCS, vol. 10460, pp. 23–639. Springer, Heidelberg (2017). doi:10.​1007/​978-3-319-63121-9_​31
2.
Zurück zum Zitat Attie, P., Baranov, E., Bliudze, S., Jaber, M., Sifakis, J.: A general framework for architecture composability. Formal Aspects Comput. 28(2), 207–231 (2016)MathSciNetCrossRefMATH Attie, P., Baranov, E., Bliudze, S., Jaber, M., Sifakis, J.: A general framework for architecture composability. Formal Aspects Comput. 28(2), 207–231 (2016)MathSciNetCrossRefMATH
3.
Zurück zum Zitat Benveniste, A., Caillaud, B., Nickovic, D., Passerone, R., Raclet, J., Reinkemeier, P., Vincentelli, A.S., Damm, W., Henzinger, T., Larsen, K.G.: Contracts for systems design: theory. INRIA report, France (2015) Benveniste, A., Caillaud, B., Nickovic, D., Passerone, R., Raclet, J., Reinkemeier, P., Vincentelli, A.S., Damm, W., Henzinger, T., Larsen, K.G.: Contracts for systems design: theory. INRIA report, France (2015)
4.
Zurück zum Zitat Biondi, A., Buttazzo, G., Simoncelli, S.: Feasibility analysis of engine control tasks under edf scheduling. In: Proceedings of ECRTS15, pp. 139–148. IEEE (2015) Biondi, A., Buttazzo, G., Simoncelli, S.: Feasibility analysis of engine control tasks under edf scheduling. In: Proceedings of ECRTS15, pp. 139–148. IEEE (2015)
5.
Zurück zum Zitat Bouyssounouse, B., Sifakis, J.: Embedded Systems Design: The ARTIST Roadmap for Research and Development, vol. 3436. Springer, Heidelberg (2005) Bouyssounouse, B., Sifakis, J.: Embedded Systems Design: The ARTIST Roadmap for Research and Development, vol. 3436. Springer, Heidelberg (2005)
6.
Zurück zum Zitat Burns, A., Wellings, A.: Concurrent and Real-Time Programming in Ada. Cambridge University Press, New York (2007)MATH Burns, A., Wellings, A.: Concurrent and Real-Time Programming in Ada. Cambridge University Press, New York (2007)MATH
7.
Zurück zum Zitat Caspi, P., Scaife, N., Sofronis, C., Tripakis, S.: Semantics-preserving multitask implementation of synchronous programs. ACM Trans. Embed. Comput. Syst. 7(2), 15:1–15:40 (2008)CrossRef Caspi, P., Scaife, N., Sofronis, C., Tripakis, S.: Semantics-preserving multitask implementation of synchronous programs. ACM Trans. Embed. Comput. Syst. 7(2), 15:1–15:40 (2008)CrossRef
8.
Zurück zum Zitat Chakabarti, A., de Alfaro, L., Henzinger, T.A., Stoelinga, M.I.A.: Resource interfaces. In: Alur, R., Lee, I. (eds.) EMSOFT 2003 (2003) Chakabarti, A., de Alfaro, L., Henzinger, T.A., Stoelinga, M.I.A.: Resource interfaces. In: Alur, R., Lee, I. (eds.) EMSOFT 2003 (2003)
9.
Zurück zum Zitat Crnkovic, I., Sentilles, S., Vulgarakis, A., Chaudron, M.R.V.: A classification framework for software component models. IEEE Trans. Softw. Eng. 37(5), 593–615 (2011)CrossRef Crnkovic, I., Sentilles, S., Vulgarakis, A., Chaudron, M.R.V.: A classification framework for software component models. IEEE Trans. Softw. Eng. 37(5), 593–615 (2011)CrossRef
11.
Zurück zum Zitat Davis, R.I., Burns, A.: A survey of hard real-time scheduling for multiprocessor systems. ACM Comput. Surv. 43(4), 35:1–35:44 (2011)CrossRefMATH Davis, R.I., Burns, A.: A survey of hard real-time scheduling for multiprocessor systems. ACM Comput. Surv. 43(4), 35:1–35:44 (2011)CrossRefMATH
12.
Zurück zum Zitat de Alfaro, L., Henzinger, T.A., Stoelinga, M.I.A.: Timed interfaces. In: EMSOFT 2002, pp. 108–122 (2002) de Alfaro, L., Henzinger, T.A., Stoelinga, M.I.A.: Timed interfaces. In: EMSOFT 2002, pp. 108–122 (2002)
13.
Zurück zum Zitat Derler, P., Lee, E.A., Tripakis, S., Törngren, M.: Cyber-physical system design contracts. In: Proceedings of the ACM/IEEE 4th International Conference on Cyber-Physical Systems, ICCPS 2013, pp. 109–118. ACM (2013) Derler, P., Lee, E.A., Tripakis, S., Törngren, M.: Cyber-physical system design contracts. In: Proceedings of the ACM/IEEE 4th International Conference on Cyber-Physical Systems, ICCPS 2013, pp. 109–118. ACM (2013)
14.
Zurück zum Zitat Ekberg, P., Yi, W.: Bounding and shaping the demand of generalized mixed-criticality sporadic task systems. Real-Time Syst. 50(1), 48–86 (2014)CrossRefMATH Ekberg, P., Yi, W.: Bounding and shaping the demand of generalized mixed-criticality sporadic task systems. Real-Time Syst. 50(1), 48–86 (2014)CrossRefMATH
15.
Zurück zum Zitat Ekberg, P., Yi, W.: A note on some open problems in mixed-criticality scheduling. In: Proceedings of the 6th International Real-Time Scheduling Open Problems Seminar (RTSOPS) (2015) Ekberg, P., Yi, W.: A note on some open problems in mixed-criticality scheduling. In: Proceedings of the 6th International Real-Time Scheduling Open Problems Seminar (RTSOPS) (2015)
16.
Zurück zum Zitat Ekberg, P., Yi, W.: Uniprocessor feasibility of sporadic tasks remains conp-complete under bounded utilization. In: Proceedings of RTSS15, pp. 87–95 (2015) Ekberg, P., Yi, W.: Uniprocessor feasibility of sporadic tasks remains conp-complete under bounded utilization. In: Proceedings of RTSS15, pp. 87–95 (2015)
17.
Zurück zum Zitat Ekberg, P., Yi, W.: Uniprocessor feasibility of sporadic tasks with constrained deadlines is strongly conp-complete. In: ECRTS 2015, pp. 281–286 (2015) Ekberg, P., Yi, W.: Uniprocessor feasibility of sporadic tasks with constrained deadlines is strongly conp-complete. In: ECRTS 2015, pp. 281–286 (2015)
18.
Zurück zum Zitat Ekberg, P., Yi, W.: Schedulability analysis of a graph-based task model for mixed-criticality systems. Real-Time Syst. 52(1), 1–37 (2016)CrossRefMATH Ekberg, P., Yi, W.: Schedulability analysis of a graph-based task model for mixed-criticality systems. Real-Time Syst. 52(1), 1–37 (2016)CrossRefMATH
19.
Zurück zum Zitat Ekberg, P., Yi, W.: Fixed-priority schedulability of sporadic tasks on uniprocessors is np-hard. In: Proceedings of RTSS17, Paris (2017) Ekberg, P., Yi, W.: Fixed-priority schedulability of sporadic tasks on uniprocessors is np-hard. In: Proceedings of RTSS17, Paris (2017)
20.
Zurück zum Zitat Guan, N., Stigge, M., Yi, W., Yu, G.: Fixed-priority multiprocessor scheduling with liu and layland’s utilization bound. In: Proceedings of RTAS 2010, Stockholm, pp. 165–174 (2010) Guan, N., Stigge, M., Yi, W., Yu, G.: Fixed-priority multiprocessor scheduling with liu and layland’s utilization bound. In: Proceedings of RTAS 2010, Stockholm, pp. 165–174 (2010)
21.
Zurück zum Zitat Guan, N., Yi, W.: Finitary real-time calculus: efficient performance analysis of distributed embedded systems. In: RTSS 2013, pp. 330–339, December 2013 Guan, N., Yi, W.: Finitary real-time calculus: efficient performance analysis of distributed embedded systems. In: RTSS 2013, pp. 330–339, December 2013
22.
Zurück zum Zitat Halbwachs, N.: Synchronous Programming of Reactive Systems. The Springer International Series in Engineering and Computer Science. Springer, New York (2013)MATH Halbwachs, N.: Synchronous Programming of Reactive Systems. The Springer International Series in Engineering and Computer Science. Springer, New York (2013)MATH
23.
Zurück zum Zitat Holthusen, S., Quinton, S., Schaefer, I., Schlatow, J., Wegner, M.: Using multi-viewpoint contracts for negotiation of embedded software updates. In: Proceedings 1st Workshop on Pre- and Post-Deployment Verification Techniques, Iceland, pp. 31–45, June 2016 Holthusen, S., Quinton, S., Schaefer, I., Schlatow, J., Wegner, M.: Using multi-viewpoint contracts for negotiation of embedded software updates. In: Proceedings 1st Workshop on Pre- and Post-Deployment Verification Techniques, Iceland, pp. 31–45, June 2016
24.
Zurück zum Zitat Krčál, P., Mokrushin, L., Thiagarajan, P.S., Yi, W.: Timed vs. time-triggered automata. In: Proceedings of CONCUR 2004, London, pp. 340–354 (2004) Krčál, P., Mokrushin, L., Thiagarajan, P.S., Yi, W.: Timed vs. time-triggered automata. In: Proceedings of CONCUR 2004, London, pp. 340–354 (2004)
25.
Zurück zum Zitat Krcál, P., Yi, W.: Decidable and undecidable problems in schedulability analysis using timed automata. In: Proceedings of TACAS 2004, pp. 236–250 (2004) Krcál, P., Yi, W.: Decidable and undecidable problems in schedulability analysis using timed automata. In: Proceedings of TACAS 2004, pp. 236–250 (2004)
26.
Zurück zum Zitat Lampka, K., Bondorf, S., Schmitt, J., Guan, N., Yi, W.: Generalized finitary real-time calculus. In: Proceedings of IEEE INFOCOM 2017, Atlanta, GA, USA (2017) Lampka, K., Bondorf, S., Schmitt, J., Guan, N., Yi, W.: Generalized finitary real-time calculus. In: Proceedings of IEEE INFOCOM 2017, Atlanta, GA, USA (2017)
27.
Zurück zum Zitat Larsen, K.G., Pettersson, P., Yi, W.: Uppaal in a nutshell. STTT 1(1), 134–152 (1997)CrossRefMATH Larsen, K.G., Pettersson, P., Yi, W.: Uppaal in a nutshell. STTT 1(1), 134–152 (1997)CrossRefMATH
28.
Zurück zum Zitat Lee, E.A.: Time for high-confidence cyber-physical systems. In: ICES workshop on Embedded and Cyber-physical Systems - Model-Based Design for Analysis and Synthesis, 6 February 2012, Stockholm, Sweden (2014) Lee, E.A.: Time for high-confidence cyber-physical systems. In: ICES workshop on Embedded and Cyber-physical Systems - Model-Based Design for Analysis and Synthesis, 6 February 2012, Stockholm, Sweden (2014)
29.
Zurück zum Zitat Leiserson, C.E., Saxe, J.B.: Optimizing synchronous systems. In: FOCS 1981, the 22nd Annual Symposium on Foundations of Computer Science, pp. 23–36. IEEE (1981) Leiserson, C.E., Saxe, J.B.: Optimizing synchronous systems. In: FOCS 1981, the 22nd Annual Symposium on Foundations of Computer Science, pp. 23–36. IEEE (1981)
30.
Zurück zum Zitat Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46–61 (1973)MathSciNetCrossRefMATH Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46–61 (1973)MathSciNetCrossRefMATH
31.
Zurück zum Zitat Lv, M., Guan, N., Ma, Y., Ji, D., Knippel, E., Liu, X., Yi, W.: Speed planning for solar-powered electric vehicles. In: Proceedings of the Seventh International Conference on Future Energy Systems, Waterloo, ON, Canada, 21–24 June 2016, pp. 6:1–6:10 (2016) Lv, M., Guan, N., Ma, Y., Ji, D., Knippel, E., Liu, X., Yi, W.: Speed planning for solar-powered electric vehicles. In: Proceedings of the Seventh International Conference on Future Energy Systems, Waterloo, ON, Canada, 21–24 June 2016, pp. 6:1–6:10 (2016)
32.
Zurück zum Zitat Mohaqeqi, M., Abdullah, J., Guan, N., Yi, W.: Schedulability analysis of synchronous digraph real-time tasks. In: Proceedings of ECRTS 2016, France, pp. 176–186 (2016) Mohaqeqi, M., Abdullah, J., Guan, N., Yi, W.: Schedulability analysis of synchronous digraph real-time tasks. In: Proceedings of ECRTS 2016, France, pp. 176–186 (2016)
33.
Zurück zum Zitat Mohaqeqi, M., Abdullah, S.M.J., Ekberg, P., Yi, W.: Refinement of workload models for engine controllers by state space partitioning. In: Proceedings of ECRTS 2017, Croatia, pp. 11:1–11:22 (2017) Mohaqeqi, M., Abdullah, S.M.J., Ekberg, P., Yi, W.: Refinement of workload models for engine controllers by state space partitioning. In: Proceedings of ECRTS 2017, Croatia, pp. 11:1–11:22 (2017)
34.
Zurück zum Zitat Stigge, M., Ekberg, P., Guan, N., Yi, W.: The digraph real-time task model. In: Proceedings of RTAS 2011, Chicago, IL, USA (2011) Stigge, M., Ekberg, P., Guan, N., Yi, W.: The digraph real-time task model. In: Proceedings of RTAS 2011, Chicago, IL, USA (2011)
35.
Zurück zum Zitat Stigge, M., Yi, W.: Combinatorial abstraction refinement for feasibility analysis. In: Proceedings of RTSS 2013 (2013) Stigge, M., Yi, W.: Combinatorial abstraction refinement for feasibility analysis. In: Proceedings of RTSS 2013 (2013)
36.
Zurück zum Zitat Stigge, M., Yi, W.: Graph-based models for real-time workload: a survey. Real-Time Syst. 51(5), 602–636 (2015)CrossRefMATH Stigge, M., Yi, W.: Graph-based models for real-time workload: a survey. Real-Time Syst. 51(5), 602–636 (2015)CrossRefMATH
37.
Zurück zum Zitat Sun, J., Guan, N., Wang, Y., He, Q., Yi, W.: Scheduling and analysis of real-time openmp task systems with tied tasks. In: Proceedings of RTSS 2017, Paris (2017) Sun, J., Guan, N., Wang, Y., He, Q., Yi, W.: Scheduling and analysis of real-time openmp task systems with tied tasks. In: Proceedings of RTSS 2017, Paris (2017)
38.
Zurück zum Zitat Sun, J., Guan, N., Wang, Y., Deng, Q., Zeng, P., Yi, W.: Feasibility of fork-join real-time task graph models: hardness and algorithms. ACM Trans. Embed. Comput. Syst. 15(1), 14:1–14:28 (2016)CrossRef Sun, J., Guan, N., Wang, Y., Deng, Q., Zeng, P., Yi, W.: Feasibility of fork-join real-time task graph models: hardness and algorithms. ACM Trans. Embed. Comput. Syst. 15(1), 14:1–14:28 (2016)CrossRef
39.
Zurück zum Zitat Tang, Y., Guan, N., Liu, W., Phan, L., Yi, W.: Revisiting gpc and and connector in real-time calculus. In: Proceedings of RTSS 2017, Paris (2017) Tang, Y., Guan, N., Liu, W., Phan, L., Yi, W.: Revisiting gpc and and connector in real-time calculus. In: Proceedings of RTSS 2017, Paris (2017)
40.
Zurück zum Zitat Thiele, L., Chakraborty, S., Naedele, M.: Real-time calculus for scheduling hard real-time systems. In: ISCAS 2000, vol. 4, pp. 101–104 (2000) Thiele, L., Chakraborty, S., Naedele, M.: Real-time calculus for scheduling hard real-time systems. In: ISCAS 2000, vol. 4, pp. 101–104 (2000)
41.
Zurück zum Zitat Thiele, L., Wandeler, E., Stoimenov, N.: Real-time interfaces for composing real-time systems. In: Proceedings of the 6th ACM & Amp; IEEE International Conference on Embedded Software, EMSOFT 2006, pp. 34–43. ACM (2006) Thiele, L., Wandeler, E., Stoimenov, N.: Real-time interfaces for composing real-time systems. In: Proceedings of the 6th ACM & Amp; IEEE International Conference on Embedded Software, EMSOFT 2006, pp. 34–43. ACM (2006)
Metadaten
Titel
Towards Customizable CPS: Composability, Efficiency and Predictability
verfasst von
Wang Yi
Copyright-Jahr
2017
DOI
https://doi.org/10.1007/978-3-319-68690-5_1

Premium Partner