Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on Fundamental Approaches to Software Engineering

FASE 2012: Fundamental Approaches to Software Engineering pp 115–129Cite as

  1. Home
  2. Fundamental Approaches to Software Engineering
  3. Conference paper
Adaptive Task Automata: A Framework for Verifying Adaptive Embedded Systems

Adaptive Task Automata: A Framework for Verifying Adaptive Embedded Systems

  • Leo Hatvani18,
  • Paul Pettersson18 &
  • Cristina Seceleanu18 
  • Conference paper
  • 1671 Accesses

  • 1 Citations

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7212)

Abstract

We present a framework for modeling and analysis of adaptive embedded systems, based on the model of timed automata with tasks. The model is extended with primitives allowing modeling of adaptivity, by testing the potential schedulability of a given task, in the context of the set of currently enqueued tasks. This makes it possible to describe adaptive embedded systems, in which decisions to admit further tasks or take other measures of adaptivity is based on available CPU resources, external, or internal events. We show that this model can be encoded in the framework of timed automata, and hence that the problem is decidable. We also validate the framework, by using the Uppaal tool.

Keywords

  • Schedule Policy
  • Task Type
  • Schedulability Analysis
  • Schedulability Test
  • High Priority Task

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Download conference paper PDF

References

  1. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126, 183–235 (1994)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Amnell, T., Fersman, E., Mokrushin, L., Pettersson, P., Yi, W.: Times: A Tool for Schedulability Analysis and Code Generation of Real-Time Systems. In: Larsen, K.G., Niebert, P. (eds.) FORMATS 2003. LNCS, vol. 2791, pp. 60–72. Springer, Heidelberg (2004)

    CrossRef  Google Scholar 

  3. Amnell, T., Fersman, E., Pettersson, P., Sun, H., Yi, W.: Code synthesis for timed automata. Nordic Journal of Computing 9(4), 269–300 (2002)

    MathSciNet  MATH  Google Scholar 

  4. Åsberg, M., Nolte, T., Pettersson, P.: Prototyping and code synthesis of hierarchically scheduled systems using times. Journal of Convergence (Consumer Electronics) 1(1), 77–86 (2010)

    Google Scholar 

  5. Buttazzo, G.C.: Hard Real-Time Computing Systems. Predictable Scheduling Algorithms and Applications. Kulwer Academic Publishers (1997)

    Google Scholar 

  6. David, A., Håkansson, J., Larsen, K., Pettersson, P.: Model Checking Timed Automata with Priorities Using DBM Subtraction. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 128–142. Springer, Heidelberg (2006)

    CrossRef  Google Scholar 

  7. David, A., Illum, J., Larsen, K., Skou, A.: Model-Based Framework for Schedulability Analysis Using UPPAAL 4.1. CRC Press (2011/12/27 (2009)

    Google Scholar 

  8. Fersman, E., Krcal, P., Pettersson, P., Yi, W.: Task automata: Schedulability, decidability and undecidability. Information and Computation 205(8), 1149–1172 (2007)

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. Fersman, E., Mokrushin, L., Pettersson, P., Yi, W.: Schedulability analysis of fixed-priority systems using timed automata. Theor. Comput. Sci. 354, 301–317 (2006)

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. Fersman, E., Pettersson, P., Yi, W.: Timed Automata with Asynchronous Processes: Schedulability and Decidability. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 67–82. Springer, Heidelberg (2002)

    CrossRef  Google Scholar 

  11. Mikučionis, M., Larsen, K., Rasmussen, J., Nielsen, B., Skou, A., Palm, S., Pedersen, J., Hougaard, P.: Schedulability Analysis Using Uppaal: Herschel-Planck Case Study. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol. 6416, pp. 175–190. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

  12. Norström, C., Wall, A., Yi, W.: Timed automata as task models for event-driven systems. In: Sixth International Conference on Real-Time Computing Systems and Applications, RTCSA 1999, pp. 182–189 (1999)

    Google Scholar 

  13. Schaefer, I.: Integrating Formal Verification into the Model-Based Development of Adaptive Embedded Systems. Ph.D. thesis, TU Kaiserslautern, Kaiserslautern, Germany (October 2008) ISBN 978-3-89963-862-2

    Google Scholar 

  14. Yu, F., Li, G., Xiong, N.: Schedulability analysis of multi-processor real-time systems using uppaal. In: 2010 2nd International Conference on Information Science and Engineering (ICISE), pp. 1–6 (December 2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mälardalen University, 721 23, Västerås, Sweden

    Leo Hatvani, Paul Pettersson & Cristina Seceleanu

Authors
  1. Leo Hatvani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paul Pettersson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Cristina Seceleanu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Universidad Autónoma de Madrid, Campus Cantoblanco, 28049, Madrid, Spain

    Juan de Lara

  2. School of Informatics, City University, Northampton Square, EC1V 0HB, London, UK

    Andrea Zisman

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hatvani, L., Pettersson, P., Seceleanu, C. (2012). Adaptive Task Automata: A Framework for Verifying Adaptive Embedded Systems. In: de Lara, J., Zisman, A. (eds) Fundamental Approaches to Software Engineering. FASE 2012. Lecture Notes in Computer Science, vol 7212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28872-2_9

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-28872-2_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28871-5

  • Online ISBN: 978-3-642-28872-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature