Improving the Efficiency of Synchronized Product with Infinite Transition Systems - Archive ouverte HAL Access content directly
Book Sections Year : 2013

Improving the Efficiency of Synchronized Product with Infinite Transition Systems

(1) , (1)
1

Abstract

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.
Not file

Dates and versions

hal-00926299 , version 1 (09-01-2014)

Identifiers

Cite

Yuliia Romenska, Frédéric Mallet. Improving the Efficiency of Synchronized Product with Infinite Transition Systems. Ermolayev, Vadim and Mayr, Heinrich C. Communications in Computer and Information Science, 412, Springer, pp.287-307, 2013, Communications in Computer and Information Science, 978-3-319-03997-8. ⟨10.1007/978-3-319-03998-5_15⟩. ⟨hal-00926299⟩
139 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More