【24h】

A Faster-than Relation for Asynchronous Processes

机译:异步过程的快于关系

获取原文
获取原文并翻译 | 示例

摘要

This paper introduces a novel (bi)simulation-based faster-than preorder which relates asynchronous processes with respect to their worst-case timing behavior. The studies are conducted for a conservative extension of the process algebra CCS, called TACS, which permits the specification of maximal time bounds of actions. The most unusual contribution is in showing that the proposed faster-than preorder coincides with two other preorders, one of which considers the absolute times at which actions occur in system runs. The paper also develops the semantic theory of TACS, addressing congruence properties, equational laws, and abstractions from internal actions.
机译:本文介绍了一种新颖的,基于(双)模拟的快于预排序的方法,该方法将异步过程与其最坏的时序行为相关联。进行这些研究是为了保守地扩展过程代数CCS(称为TACS),该过程允许指定动作的最大时限。最不寻常的贡献是,表明拟议的快于预购订单与其他两个预购订单相吻合,其中之一考虑了系统运行中发生动作的绝对时间。本文还开发了TACS的语义理论,解决了同余性质,方程式定律和内部行为的抽象。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号