Universal algebra usually considers and examines algebras as static entities. In the mid 80ies Gurevich proposed Abstract State Machines (ASMs) as a computation model that regards algebras as dynamic: a state of an ASM is represented by a freely chosen algebra which may change during a computation. In 8 Gurevich characterizes the class of sequential ASMs in a purely semantic way by five amazingly general and elegant axioms. In 9 this result is extended to bounded-nondeterministic ASMs. This paper considers the general case of unbounded-nondeterministic ASMs: in each step, an unbounded-nondeterministic ASM may choose among unboundedly many (sometimes infinitely many) alternatives. We characterize the class of unbounded-nondeterministic ASMs by an extension of Gurevich^a€™s original axioms for sequential ASMs. We apply this result to prove the reversibility of unbounded-nondeterministic ASMs.
%0 Book Section
%1 glausch_07_semantic
%A Glausch, Andreas
%A Reisig, Wolfgang
%D 2007
%J Algebra and Coalgebra in Computer Science
%K 2007 semantics asm
%P 242--256
%R 10.1007/978-3-540-73859-6_17
%T A Semantic Characterization of Unbounded-Nondeterministic Abstract State Machines
%U http://dx.doi.org/10.1007/978-3-540-73859-6_17
%X Universal algebra usually considers and examines algebras as static entities. In the mid 80ies Gurevich proposed Abstract State Machines (ASMs) as a computation model that regards algebras as dynamic: a state of an ASM is represented by a freely chosen algebra which may change during a computation. In 8 Gurevich characterizes the class of sequential ASMs in a purely semantic way by five amazingly general and elegant axioms. In 9 this result is extended to bounded-nondeterministic ASMs. This paper considers the general case of unbounded-nondeterministic ASMs: in each step, an unbounded-nondeterministic ASM may choose among unboundedly many (sometimes infinitely many) alternatives. We characterize the class of unbounded-nondeterministic ASMs by an extension of Gurevich^a€™s original axioms for sequential ASMs. We apply this result to prove the reversibility of unbounded-nondeterministic ASMs.
@incollection{glausch_07_semantic,
abstract = {Universal algebra usually considers and examines algebras as static entities. In the mid 80ies Gurevich proposed Abstract State Machines (ASMs) as a computation model that regards algebras as dynamic: a state of an ASM is represented by a freely chosen algebra which may change during a computation. In [8] Gurevich characterizes the class of sequential ASMs in a purely semantic way by five amazingly general and elegant axioms. In [9] this result is extended to bounded-nondeterministic ASMs. This paper considers the general case of unbounded-nondeterministic ASMs: in each step, an unbounded-nondeterministic ASM may choose among unboundedly many (sometimes infinitely many) alternatives. We characterize the class of unbounded-nondeterministic ASMs by an extension of Gurevich^{a}€™s original axioms for sequential ASMs. We apply this result to prove the reversibility of unbounded-nondeterministic ASMs.},
added-at = {2009-02-11T20:50:41.000+0100},
author = {Glausch, Andreas and Reisig, Wolfgang},
biburl = {https://www.bibsonomy.org/bibtex/275a96d8a5cc4c4dc70a663f3b6a895ba/leonardo},
citeulike-article-id = {1589815},
doi = {10.1007/978-3-540-73859-6_17},
interhash = {6170d3ea484dddfae1b933979c9234f0},
intrahash = {75a96d8a5cc4c4dc70a663f3b6a895ba},
journal = {Algebra and Coalgebra in Computer Science},
keywords = {2007 semantics asm},
pages = {242--256},
posted-at = {2007-08-24 14:37:05},
priority = {2},
timestamp = {2009-02-11T20:50:41.000+0100},
title = {A Semantic Characterization of Unbounded-Nondeterministic Abstract State Machines},
url = {http://dx.doi.org/10.1007/978-3-540-73859-6_17},
year = 2007
}