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.
- R. Alur and D. Dill. 1994. A theory of timed automata. Journal of Theoretical Computer Science 126, 2 (1994), 183--235. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- L. de Alfaro and T. Henzinger. 2001. Interface theories for component-based design. In ACM International Conference on Embedded Software (EMSOFT). 148--165. Google Scholar
Digital Library
- L. de Alfaro, T. Henzinger, and M. Stoelinga. 2002. Timed interfaces. In ACM International Workshop on Embedded Software (EMSOFT). 108--122. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
- E. Lee and S. Seshia. 2015. Introduction to Embedded Systems: A Cyber-physical Systems Approach (2nd ed.). Google Scholar
Digital Library
- R. Milner. 1971. An algebraic definition of simulation between programs. In International Joint Conference on Artificial Intelligence (IJCAI). 481--489. Google Scholar
Digital Library
- S. Sriram and S. Bhattacharyya. 2009. Embedded Multiprocessors: Scheduling and Synchronization (2nd ed.). Google Scholar
Digital Library
- S. Tripakis and others. 2009. On relational interfaces. In ACM International Conference on Embedded Software (EMSOFT). 67--76. Google Scholar
Digital Library
- M. Wiggers, M. Bekooij, and G. Smit. 2009. Monotonicity and run-time scheduling. In ACM International Conference on Embedded Software (EMSOFT). 177--186. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
Index Terms
An Abstraction-Refinement Theory for the Analysis and Design of Real-Time Systems
Recommendations
SAT-based Abstraction Refinement for Real-time Systems
In this paper, we present an abstraction refinement approach for model checking safety properties of real-time systems using SAT-solving. We present a faithful embedding of bounded model checking for systems of timed automata into propositional logic ...
Compositional Abstraction Refinement for Timed Systems
TASE '10: Proceedings of the 2010 4th IEEE International Symposium on Theoretical Aspects of Software EngineeringModel checking suffers from the state explosion problem. Compositional abstraction and abstraction refinement have been investigated in many areas to address this problem. This paper considers the compositional model checking for timed systems. We ...
Abstraction refinement for termination
SAS'05: Proceedings of the 12th international conference on Static AnalysisAbstraction can often lead to spurious counterexamples. Counterexample-guided abstraction refinement is a method of strengthening abstractions based on the analysis of these spurious counterexamples. For invariance properties, a counterexample is a ...






Comments