Improving the Efficiency of Synchronized Product with Infinite Transition Systems
Embedded System Design is becoming a field of choice for Model-Driven Engineering techniques. On the engineering side, models bring an abstraction of the code that can then be generated (and regenerated) at will. On the semantic side, they bring a reasoning framework to guarantee or verify properties on the generated code. We focus here on the Clock Constraint Specification Language, initially defined as a companion language of the uml Profile for marte. More specifically, we propose a state-based data-structure inspired by lazy evaluation technique to represent the unbounded ccsl operators. Lazy evaluation allows for an intentional representation of infinite transition systems. We provide an algorithm to compute the synchronized product of such transition systems. Even though the transition systems are infinite, the result of the composition may become finite, in which case the (semi)algorithm terminates and exhaustive analysis becomes possible. We also study the time complexity and show that it is exponential in the number of clocks. We then explore several solutions where this worst-case estimation is not attained and where analyses have a much better complexity in practice.
KeywordsMultiform logical time synchronized product lazy evaluation marte ccsl
Unable to display preview. Download preview PDF.
- 1.OMG: UML Profile for MARTE, v1.0. Object Management Group, formal/2009-11-02 (November 2009)Google Scholar
- 2.André, C.: Syntax and Semantics of the Clock Constraint Specification Language (CCSL). Research Report RR-6925, INRIA (2009)Google Scholar
- 6.Gascon, R., Mallet, F., DeAntoni, J.: Logical time and temporal logics: Comparing UML MARTE/CCSL and PSL. In: TIME, pp. 141–148 (2011)Google Scholar
- 7.Yin, L., Mallet, F., Liu, J.: Verification of MARTE/CCSL time requirements in Promela/SPIN. In: ICECCS, pp. 65–74 (2011)Google Scholar
- 8.Mallet, F.: Automatic generation of observers from MARTE/CCSL. In: IEEE Int. Symp. on Rapid System Prototyping, pp. 86–92. IEEE (October 2012)Google Scholar
- 9.Johnsson, T.: Efficient compilation of lazy evaluation. In: SIGPLAN Symposium on Compiler Construction, pp. 58–69. ACM (1984)Google Scholar
- 10.Arnold, A.: Synchronized products of transition systems and their analysis. In: ICATPN, pp. 26–27 (1998)Google Scholar
- 11.Romenska, Y., Mallet, F.: Lazy parallel synchronous composition of infinite transition systems. In: ICTERI. CEUR Workshop Proceedings, vol. 1000, pp. 130–145. CEUR-WS.org (2013)Google Scholar
- 14.Sorea, M.: Lazy approximation for dense real-time systems. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS/FTRTFT 2004. LNCS, vol. 3253, pp. 363–378. Springer, Heidelberg (2004)Google Scholar
- 19.Arnold, A.: Finite transition systems - semantics of communicating systems. Prentice Hall international series in computer science. Prentice Hall (1994)Google Scholar
- 21.DeAntoni, J., André, C., Gascon, R.: CCSL denotational semantics. Research Report RR-8000, INRIA (2010)Google Scholar