首页> 外文会议>Concurrency theory >From higher-order #pi#-calculus to #pi#-calculus in the presence of static operaotrs
【24h】

From higher-order #pi#-calculus to #pi#-calculus in the presence of static operaotrs

机译:从存在静态算子的高阶#pi#-微积分到#pi#-微积分

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

摘要

Some applicaitons of higher-ordr processes reuire better control of ocmmunication capabilities than what is provided by the #pi#-caculus primitives.In particular we have found the dynamic restrictin operaotr of CHOCS,here called blocking,useful.We investigate the consequenes of adding static operators such as blocking to the first and higher-ordr #pi#-calculus.In the presence of the blockign oeprator (and static operators in geenral) the higher-order reduction of Sangiorgi,used to demonstrate the reducibility of hihger-order ocmmunciation fretyures to first-ordr ones,breaks down.
机译:比#pi#-caculus原语所提供的功能更高级的应用程序要求对通信功能的控制更好。特别是,我们发现了CHOCS的动态限制器,这里称为阻塞,很有用。我们研究了添加的后遗症静态算子,例如对第一阶和更高阶的#pi#演算的阻塞。在存在块体运算符(以及静态的静态算子)的情况下,Sangiorgi的高阶还原用于证明高阶通信的可还原性对第一手的苦恼,崩溃了。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号