On the expressiveness of refinement settings



Downloads per month over past year

Fecher, Harald and Frutos Escrig, David de and Lüttgen, Gerald and Schmidt, Heiko (2010) On the expressiveness of refinement settings. In Fundamentals of Software Engineering : Third IPM International Conference, FSEN 2009, Kish Island, Iran, April 15-17, 2009, Revised Selected Papers. Lecture notes in computer science (5961). Springer, pp. 276-291. ISBN 978-3-642-11622-3

[thumbnail of Frutos47springer.pdf] PDF
Restringido a Repository staff only


Official URL: http://link.springer.com/content/pdf/10.1007%2F978-3-642-11623-0_16.pdf


Embedded-systems designers often use transition system-based notations for specifying, with respect to some refinement preorder, sets of deterministic implementations. This paper compares popular such refinement settings — ranging from transition systems equipped with failure-pair inclusion to disjunctive modal transition systems — regarding the sets of implementations they are able to express. The paper’s main result is an expressiveness hierarchy, as well as language-preserving transformations between various settings. In addition to system designers, the main beneficiaries of this work are tool builders who wish to reuse refinement checkers or model checkers across different settings.

Item Type:Book Section
Subjects:Sciences > Computer science
ID Code:20934
Deposited On:19 Apr 2013 09:16
Last Modified:19 Feb 2019 10:59

Origin of downloads

Repository Staff Only: item control page