RT Book, Section
T1 On the expressiveness of refinement settings
A1 Fecher, Harald
A1 Frutos Escrig, David De
A1 Lüttgen, Gerald
A1 Schmidt, Heiko
A2 Arbab, Fahrad
A2 Marjan, Sirjani
AB 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.
PB Springer
SN 978-3-642-11622-3
YR 2010
FD 2010
LK https://hdl.handle.net/20.500.14352/45442
UL https://hdl.handle.net/20.500.14352/45442
LA eng
NO Fecher, H., Frutos Escrig, D., Lüttgen, G. & Schmidt, H. «On the Expressiveness of Refinement Settings». Fundamentals of Software Engineering, editado por Farhad Arbab y Marjan Sirjani, vol. 5961, Springer Berlin Heidelberg, 2010, pp. 276-91. DOI.org (Crossref), https://doi.org/10.1007/978-3-642-11623-0_16.
NO DFG
NO Engineering & Physical Sciences Research Council (Reino Unido)
NO Ministerio de Educación, Formación Profesional y Deportes (España)
DS Docta Complutense
RD 7 abr 2025