While Abstract State Machines (ASMs) provide a general purpose development method, it is advantageous to provide extensions that ease their use in particular application areas. This paper focuses on such extensions for the benefit of a “refinement calculus�? in the area of data warehouses and on-line analytical processing (OLAP). We show that providing typed ASMs helps to exploit the existing logical formalisms used in data-intensive areas to define a ground model and refinement rules. We also note that the extensions do not increase the expressiveness of ASMs, as each typed ASM will be equivalent to an “ordinary�? one.
%0 Book Section
%1 link_07_refinements
%A Link, Sebastian
%A Schewe, Klaus D.
%A Zhao, Jane
%D 2007
%J Perspectives of Systems Informatics
%K 2007 refinement statecharts \_pdf asm
%P 310--321
%R http://dx.doi.org/10.1007/978-3-540-70881-0\_27
%T Refinements in Typed Abstract State Machines
%U http://dx.doi.org/10.1007/978-3-540-70881-0\_27
%X While Abstract State Machines (ASMs) provide a general purpose development method, it is advantageous to provide extensions that ease their use in particular application areas. This paper focuses on such extensions for the benefit of a “refinement calculus�? in the area of data warehouses and on-line analytical processing (OLAP). We show that providing typed ASMs helps to exploit the existing logical formalisms used in data-intensive areas to define a ground model and refinement rules. We also note that the extensions do not increase the expressiveness of ASMs, as each typed ASM will be equivalent to an “ordinary�? one.
@incollection{link_07_refinements,
abstract = {While Abstract State Machines (ASMs) provide a general purpose development method, it is advantageous to provide extensions that ease their use in particular application areas. This paper focuses on such extensions for the benefit of a \^{a}€{\oe}refinement calculus\"{i}¿½? in the area of data warehouses and on-line analytical processing (OLAP). We show that providing typed ASMs helps to exploit the existing logical formalisms used in data-intensive areas to define a ground model and refinement rules. We also note that the extensions do not increase the expressiveness of ASMs, as each typed ASM will be equivalent to an \^{a}€{\oe}ordinary\"{i}¿½? one.},
added-at = {2009-03-10T04:38:58.000+0100},
author = {Link, Sebastian and Schewe, Klaus D. and Zhao, Jane},
biburl = {https://www.bibsonomy.org/bibtex/2dc7d9e6fc8f03aa5a3c4f8648f83f25b/leonardo},
citeulike-article-id = {1538202},
doi = {http://dx.doi.org/10.1007/978-3-540-70881-0\_27},
interhash = {4043167132ebd004dd64c999d2c1253f},
intrahash = {dc7d9e6fc8f03aa5a3c4f8648f83f25b},
journal = {Perspectives of Systems Informatics},
keywords = {2007 refinement statecharts \_pdf asm},
pages = {310--321},
posted-at = {2007-08-06 15:09:55},
priority = {4},
timestamp = {2009-03-10T04:38:58.000+0100},
title = {Refinements in Typed Abstract State Machines},
url = {http://dx.doi.org/10.1007/978-3-540-70881-0\_27},
year = 2007
}