• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>10th International Workshop on Abstract State Machines 2003: Advances in Theory and Practice ASM 2003, Mar 3-7, 2003, Taormina, Italy >The Hidden Computation Steps of Turbo Abstract State Machines
【24h】

The Hidden Computation Steps of Turbo Abstract State Machines

机译：Turbo抽象状态机的隐藏计算步骤

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

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.
机译：Turbo抽象状态机是具有并行和顺序组合以及可能递归子机调用的ASM。 Turbo ASM被视为黑匣子，可以将一个或多个子计算机的任意多个步骤组合为一个大步骤。涡轮ASM的中间步骤无法从外部观察到。甚至不清楚中间步骤到底是什么，因为涡轮ASM的语义通常是沿着ASM的调用图和规则主体的结构来归纳定义的。 Turbo ASM最重要的应用是递归算法。这样的算法可以直接在Turbo ASM上进行仿真，而无需将其转换为多代理（分布式）ASM。在本文中，我们分析了Turbo ASM的隐藏中间步骤，并使用PAR / SEQ树对其进行了表征。我们还解决了存在递归和顺序组合时的储备金问题。具有返回值的Turbo ASM通过语法糖获得。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号