The hidden computation steps of turbo abstract state machines
METADATA ONLY
Loading...
Author / Producer
Date
2003
Publication Type
Conference Paper
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Abstract
Turbo Abstract State Machines are ASMs with parallel and sequential composition and possibly recursive submachine calls. Turbo ASMs are viewed as black-boxes that can combine arbitrary many steps of one or more submachines into one big step. The intermediate steps of a turbo ASM are not observable from outside. It is not even clear what exactly the intermediate steps are, because the semantics of turbo ASMs is usually defined inductively along the call graph of the ASM and the structure of the rule bodies. The most important application of turbo ASMs are recursive algorithms. Such algorithms can directly be simulated on turbo ASMs without transforming them into multi-agent (distributed) ASMs. In this article we analyze the hidden intermediate steps of turbo ASMs and characterize them using PAR/SEQ trees. We also address the problem of the reserve in the presence of recursion and sequential composition. Turbo ASMs with return values are obtained by syntactic sugar.
Permanent link
Publication status
published
External links
Book title
Abstract State Machines 2003
Journal / series
Volume
2589
Pages / Article No.
244 - 262
Publisher
Springer
Event
10th International Workshop on Abstract State Machines (ASM 2003)
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Organisational unit
Notes
Funding
Related publications and datasets
Is previous version of: