skip to main content
research-article

An Abstraction-Refinement Theory for the Analysis and Design of Real-Time Systems

Published:27 September 2017Publication History
Skip Abstract Section

Abstract

Component-based and model-based reasonings are key concepts to address the increasing complexity of real-time systems. Bounding abstraction theories allow to create efficiently analyzable models that can be used to give temporal or functional guarantees on non-deterministic and non-monotone implementations. Likewise, bounding refinement theories allow to create implementations that adhere to temporal or functional properties of specification models. For systems in which jitter plays a major role, both best-case and worst-case bounding models are needed.

In this paper we present a bounding abstraction-refinement theory for real-time systems. Compared to the state-of-the-art TETB refinement theory, our theory is less restrictive with respect to the automatic lifting of properties from component to graph level and does not only support temporal worst-case refinement, but evenhandedly temporal and functional, best-case and worst-case abstraction and refinement.

References

  1. R. Alur and D. Dill. 1994. A theory of timed automata. Journal of Theoretical Computer Science 126, 2 (1994), 183--235. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. A. Dasdan. 2004. Experimental analysis of the fastest optimum cycle ratio and mean algorithms. ACM Transactions on Design Automation of Electronic Systems (TODAES) 9, 4 (2004), 385--418. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. A. David and others. 2010. Timed I/O automata: A complete specification theory for real-time systems. In ACM International Conference on Hybrid Systems: Computation and Control (HSCC). 91--100. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. L. de Alfaro and T. Henzinger. 2001. Interface automata. In European Software Engineering Conference and ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE). 109--120. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. L. de Alfaro and T. Henzinger. 2001. Interface theories for component-based design. In ACM International Conference on Embedded Software (EMSOFT). 148--165. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. L. de Alfaro, T. Henzinger, and M. Stoelinga. 2002. Timed interfaces. In ACM International Workshop on Embedded Software (EMSOFT). 108--122. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M. Geilen, S. Tripakis, and M. Wiggers. 2011. The earlier the better: A theory of timed actor interfaces. In ACM International Conference on Hybrid Systems: Computation and Control (HSCC). 23--32. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J. Hausmans and others. 2013. Dataflow analysis for multiprocessor systems with non-starvation-free schedulers. In International Workshop on Software and Compilers for Embedded Systems (SCOPES). 13--22. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J. Hausmans and M. Bekooij. 2016. A refinement theory for timed dataflow analysis with support for reordering. In ACM International Conference on Embedded Software (EMSOFT). Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. P. Kurtin and M. Bekooij. 2017. An Abstraction-refinement Theory for the Analysis and Design of Real-time Systems (Extended Version). Technical Report. Centre for Telematics and Information Technology (CTIT), University of Twente, Enschede, The Netherlands.Google ScholarGoogle Scholar
  11. P. Kurtin, J. Hausmans, and M. Bekooij. 2016. Combining offsets with precedence constraints to improve temporal analysis of cyclic real-time streaming applications. In Real-Time and Embedded Technology and Applications Symposium (RTAS). 1--12.Google ScholarGoogle Scholar
  12. E. Lee and S. Seshia. 2015. Introduction to Embedded Systems: A Cyber-physical Systems Approach (2nd ed.). Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. R. Milner. 1971. An algebraic definition of simulation between programs. In International Joint Conference on Artificial Intelligence (IJCAI). 481--489. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. S. Sriram and S. Bhattacharyya. 2009. Embedded Multiprocessors: Scheduling and Synchronization (2nd ed.). Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. S. Tripakis and others. 2009. On relational interfaces. In ACM International Conference on Embedded Software (EMSOFT). 67--76. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. M. Wiggers, M. Bekooij, and G. Smit. 2009. Monotonicity and run-time scheduling. In ACM International Conference on Embedded Software (EMSOFT). 177--186. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. P. Wilmanns and others. 2014. Accuracy improvement of dataflow analysis for cyclic stream processing applications scheduled by static priority preemptive schedulers. In Euromicro Conference on Digital System Design Architectures, Methods and Tools (DSD). 9--18. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. P. Wilmanns and others. 2015. Buffer sizing to reduce interference and increase throughput of real-time stream processing applications. In IEEE International Symposium on Real-Time Computing (ISORC). 9--18. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. An Abstraction-Refinement Theory for the Analysis and Design of Real-Time Systems

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM Transactions on Embedded Computing Systems
            ACM Transactions on Embedded Computing Systems  Volume 16, Issue 5s
            Special Issue ESWEEK 2017, CASES 2017, CODES + ISSS 2017 and EMSOFT 2017
            October 2017
            1448 pages
            ISSN:1539-9087
            EISSN:1558-3465
            DOI:10.1145/3145508
            Issue’s Table of Contents

            Copyright © 2017 ACM

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 27 September 2017
            • Revised: 1 June 2017
            • Accepted: 1 June 2017
            • Received: 1 April 2017
            Published in tecs Volume 16, Issue 5s

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article
            • Research
            • Refereed

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!