Static timing analysis of real-time systems
Authors: 
M. Jourdan, 
F. MaraninchiAuthors Info & Claims
M. Jourdan, F. MaraninchiAuthors Info & ClaimsAbstract
The approach we propose consists in describing a real-time system with a timed extension of a synchronous language. The formal semantics of the language describes how programs can be translated into a wide class of models, usually labeled transition systems, but whose labels can range from pure boolean information to complex assignements to real-valued variables. In particular, Timed Graphs [ACD90] may be obtained. We then use a tool which implements a symbolic modelchecking algorithm for TCTL [ACD90] properties of Timed Graphs. We illustrate the approach with an example taken from robotics. Several real-time tasks are involved in a synchronization scheme, sending and receiving messages, according to various protocols. They are periodically re-activated by an external controller, and should not be re-activated if they are still communicating with each other. We show how to statically determine whether a particular choice of the re-activation delays would allow a deadlock.
References
[1]
R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-time systems. In Proceedings of the fifth annual IEEE symposium on Logics In Computer Science, pages 414-425, Philadelphie, PA, USA, June 1990.
[2]
A. Benveniste and G. Berry. The synchronous approach to reactive and real-time systems. Proceedings of the IEEE, Vol. 79, No. 9, September 1991.
[3]
T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model-checking for realtime systems. In LICS'92. IEEE Computer Society Press, June 1992.
[4]
Another look at real-time programming. Special Section of the Proceedings of the IEEE, 79(9), September 1991.
[5]
M. Jourdan and F. Maraninchi. A modular state/transition approach for programming reactive systems. In Worshop on Language, Compiler, and Tool Support for Real-Time Systems, Orlando, June 1994.
[6]
M. Jourdan, F. Maraninchi, and A. Olivero. Verifying quantitative real-time properties of synchronous programs. In 5th International Conference on Computer-aided Verification, Elounda, June 1993. LNCS 697, Springer Verlag.
[7]
F. Maraninchi. Operational and compositional semantics of synchronous automaston compositions. In CONCUR. LNCS 630, Springer Verlag, August 1992.
[8]
D. Simon, B. Espiau, E. Castillo, and K. Kappellos. Computer-aided design of a generic robot controller handling reactivity and real-time control issues. In IEEE Transactions on Control Systems Technology, vol. 1, no 4, December 1993.
Index Terms
- Static timing analysis of real-time systems
Recommendations
Static timing analysis of real-time systems
LCTES '95: Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, & tools for real-time systemsThe approach we propose consists in describing a real-time system with a timed extension of a synchronous language. The formal semantics of the language describes how programs can be translated into a wide class of models, usually labeled transition ...
Specification and Timing Analysis of Real-Time Systems
The correctness of hard real-time systems depends not only on the correct functional behavior but also on the correct temporal behavior. That is, the designed hard real-time system should meet all its functional and timing requirements even in the worst ...
Static timing analysis for hard real-time systems
VMCAI'10: Proceedings of the 11th international conference on Verification, Model Checking, and Abstract InterpretationHard real-time systems have to satisfy strict timing constraints. To prove that these constraints are met, timing analyses aim to derive safe upper bounds on tasks’ execution times. Processor components such as caches, out-of-order pipelines, and ...
Comments
Information & Contributors
Information
Published In
Nov. 1995
149 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/216633
- Editors:
- Richard Gerber,
- Thomas Marlowe
Copyright © 1995 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 November 1995
Published in SIGPLAN Volume 30, Issue 11
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 410Total Downloads
- Downloads (Last 12 months)95
- Downloads (Last 6 weeks)17
Reflects downloads up to 23 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in