Abstract
With the increasing complexity of today’s embedded systems, there is a need to formally verify such designs at mixed abstraction levels. This is needed if some components are described at high levels of abstraction, whereas others are described at low levels. Components in single abstraction level designs communicate through channels, which capture essential features of the communication. If the connected components communicate at different abstraction levels, then these channels are replaced with transactors that translate requests back and forth between the abstraction levels. It is important that the transactor still preserves the external characteristics, e.g. timing, of the original channel. This chapter proposes a technique to generate such transactors. According to this technique, transactors are specified in a single formal language, which is capable of capturing timing aspects. The approach is especially targeted to formal verification.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bombieri N, Fummi F, Pravadelli G (2006) On the Evaluation of Transactor-based Verification for Reusing TLM Assertions and Testbenches at RTL. Proc. ACM/IEEE Design and Test in Europe, Munich, Germany, 6–10 March
Akella J, McMillan K (1991) Synthesizing Converters between Finite State Protocols. Proc. International Conference on Computer Design, Cambridge, MA, Oct. 15–15, pp. 410–413
Passerone R, Rowson JA, Sangiovanni-Vincentelli, A (1998) Automatic Synthesis of Interfaces between Incompatible Protocols. Proc. Design Automation Conference, San Francisco, CA, June, pp. 8–13
Bombieri N, Fummi F, Pravadelli G (2006) A TLM Design for Verification Methodology. IEEE Ph.D. Research in Microelectronics and Electronics, Otranto (LE), Italy, 11–15 June, 337–340
Balarin F, Passerone R (2006) Functional Verification Methodology Based on Formal Interface Specification and Transactor Generation. Proc. Design and Test in Europe, Munich, Germany, pp. 1013–1018
Asarin E, Caspi P, Maler O (1997) A Kleene Theorem for Timed Automata. Proc. Logic in Computer Science, Warsaw, Poland, June, pp. 160–171
Karlsson D, Eles P, Peng Z (2007) Formal Verification of Component-based Designs. Journal of Design Automation for Embedded Systems 11(1):49–90
Alur R, Courcoubetis C, Dill DL (1990) Model Checking for Real-time Systems. Theoretical Computer Science 414–425
UPPAAL homepage: http://www.uppaal.com/
Cortés LA, Eles P, Peng Z (2000) Verification of Embedded Systems Using a Petri Net Based Representation. Proc. International Symposium on System Synthesis, Madrid, Spain, pp. 149–155
Alur R, Dill DL (1994) A Theory of Timed Automata. Theoretical Computer Science 126:183–235
Kozen DC (1997) Automata and Computability. Springer, New York.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science + Business Media B.V
About this chapter
Cite this chapter
Karlsson, D., Eles, P., Peng, Z. (2008). Transactor-Based Formal Verification of Real-Time Embedded Systems. In: Villar, E. (eds) Embedded Systems Specification and Design Languages. Lecture Notes in Electrical Engineering, vol 10. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-8297-9_18
Download citation
DOI: https://doi.org/10.1007/978-1-4020-8297-9_18
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-8296-2
Online ISBN: 978-1-4020-8297-9
eBook Packages: EngineeringEngineering (R0)