Model-checking HELENA ensembles with spin

7Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Helena approach allows to specify dynamically evolving ensembles of collaborating components. It is centered around the notion of roles which components can adopt in ensembles. In this paper, we focus on the early verification of Helena models. We propose to translate Helena specifications into Promela and check satisfaction of LTL properties with Spin [11]. To prove the correctness of the translation, we consider an SOS semantics of (simplified variants of) Helena and Promela and establish stutter trace equivalence between them. Thus, we can guarantee that a Helena specification and its Promela translation satisfy the same LTL formulae (without next). Our correctness proof relies on a new, general criterion for stutter trace equivalence.

Cite

CITATION STYLE

APA

Hennicker, R., Klarl, A., & Wirsing, M. (2015). Model-checking HELENA ensembles with spin. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9200, pp. 331–360). Springer Verlag. https://doi.org/10.1007/978-3-319-23165-5_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free