TY - GEN
T1 - Synthesizing distributed scheduling implementation for probabilistic component-based systems
AU - Bensalem, Saddek
AU - Legay, Axel
AU - Nouri, Ayoub
AU - Peled, Doron
N1 - Place of conference:Portland, Oragon
PY - 2013
Y1 - 2013
N2 - Developing concurrent systems typically involves a lengthy debugging period, due to the huge number of possible intricate behaviors. Using a high level description formalism at the intermediate level between the specification and the code can vastly help reduce the cost of this process, and the existence of remaining bugs in the deployed code. Verification is much more affordable at this level. An automatic translation of component based systems into running code, which preserves the temporal properties of the design, helps synthesizing reliable code. We provide here a transformation from a high level description formalism of component based system with probabilistic choices into running code. This transformation involves synchronization using shared variables. This synchronization is component-based rather than interaction-based, because of the need to guarantee a stable view for a component that performs probabilistic choice. We provide the synchronization algorithm and report on the implementation.
AB - Developing concurrent systems typically involves a lengthy debugging period, due to the huge number of possible intricate behaviors. Using a high level description formalism at the intermediate level between the specification and the code can vastly help reduce the cost of this process, and the existence of remaining bugs in the deployed code. Verification is much more affordable at this level. An automatic translation of component based systems into running code, which preserves the temporal properties of the design, helps synthesizing reliable code. We provide here a transformation from a high level description formalism of component based system with probabilistic choices into running code. This transformation involves synchronization using shared variables. This synchronization is component-based rather than interaction-based, because of the need to guarantee a stable view for a component that performs probabilistic choice. We provide the synchronization algorithm and report on the implementation.
UR - http://www.scopus.com/inward/record.url?scp=84893435700&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84893435700
SN - 9781479909032
T3 - 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2013
SP - 87
EP - 96
BT - 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2013
PB - IEEE Computer Society
T2 - 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2013
Y2 - 18 October 2013 through 20 October 2013
ER -