Abstract
We compare the control structures of Abstract State Machines (in short ASM) defined by Yuri Gurevich and AsmL, a language implementing it. AsmL is not an algorithmically complete language, as opposed to ASM, but it is closer to usual programming languages allowing until and while iterations and sequential composition. We here give a formal definition of AsmL, its semantics, and we construct, for each AsmL program Π, a normal form (which is an ASM program) Π n computing the same function as Π. The number of comparisons and updates during the execution of the normal form is at most three times the number of comparisons and updates in the original program. © 2010 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Cégielski, P., & Guessarian, I. (2010). Normalization of some extended abstract state machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6300 LNCS, pp. 165–180). https://doi.org/10.1007/978-3-642-15025-8_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
