Transaction Level Models are widely being used as high-level reference models during embedded systems development. High simulation speed and great modeling flexibility are the main reasons for the success of TLMs. While modeling flexibility is desirable for the TLM designer, it generates problems during analysis and verification of the model. In this paper we formalize the notion of Transaction Level Models by introducing a set of rules that allow the transformation of TLMs to a set of communicating state machines. SystemC being the most popular TLM language, we additionally present a finite state model of the SystemC scheduler. Finally, we demonstrate that using our modeling approach, a standard model checker can be employed to formally prove properties on the finite state model.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer
About this chapter
Cite this chapter
Niemann, B., Haubelt, C., Oyanguren, M.U., Teich, J. (2007). Formalizing TLM with Communicating State Machines. In: Huss, S.A. (eds) Advances in Design and Specification Languages for Embedded Systems. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-6149-3_14
Download citation
DOI: https://doi.org/10.1007/978-1-4020-6149-3_14
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-6147-9
Online ISBN: 978-1-4020-6149-3
eBook Packages: EngineeringEngineering (R0)