Lazy Parallel Synchronous Composition of In finite Transition Systems - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Lazy Parallel Synchronous Composition of In finite 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 de fined as a companion language of the UML Profile for MARTE. More specifically, we define a state-based representation of CCSL operators. To deal with unbounded operators, we propose to use lazy evaluation to represent intentionally in finite transition systems. We provide an algorithm to make the synchronized product of such transition systems and we study its complexity. 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.
Fichier principal
Vignette du fichier
06_ICTERI13.pdf (353.07 Ko) Télécharger le fichier
Vignette du fichier
LazyComposition.pdf (645.55 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Format : Other

Dates and versions

hal-00839978 , version 1 (01-07-2013)

Identifiers

  • HAL Id : hal-00839978 , version 1

Cite

Yuliia Romenska, Frédéric Mallet. Lazy Parallel Synchronous Composition of In finite Transition Systems. International Conference on ICT in Education, Research and Industrial Applications, Jun 2013, Kherson, Ukraine. pp.130-145. ⟨hal-00839978⟩
223 View
237 Download

Share

Gmail Facebook Twitter LinkedIn More