2026-06-29T07:26:53Zhttps://docta.ucm.es/rest/oai/requestoai:docta.ucm.es:20.500.14352/454422024-07-10T14:24:58Zcom_20.500.14352_14col_20.500.14352_21
On the expressiveness of refinement settings
Fecher, Harald
Frutos Escrig, David De
Lüttgen, Gerald
Schmidt, Heiko
Arbab, Fahrad
Marjan, Sirjani
004
Informática (Informática)
1203.17 Informática
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.
DFG
Engineering & Physical Sciences Research Council (Reino Unido)
Ministerio de Educación, Formación Profesional y Deportes (España)
Sección Deptal. de Sistemas Informáticos y Computación
Fac. de Ciencias Matemáticas
Instituto de Matemática Interdisciplinar (IMI)
TRUE
pub
2023-06-20T05:45:16Z
2023-06-20T05:45:16Z
2010
book part
https://hdl.handle.net/20.500.14352/45442
XXXX-XXXX
10.1007/978-3-642-11623-0_16
eng
Lecture notes in computer science
FE 942/2-1
RO 1122/12-2
EP/E034853/1
TIN2006-15660-C02-01
TIN2006-15578-C02-01
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.
restricted access
application/pdf
Springer