首页    期刊浏览 2024年12月03日 星期二
登录注册

文章基本信息

  • 标题:Approximating Weak Bisimilarity of Basic Parallel Processes
  • 本地全文:下载
  • 作者:Piotr Hofman ; Patrick Totzke
  • 期刊名称:Electronic Proceedings in Theoretical Computer Science
  • 电子版ISSN:2075-2180
  • 出版年度:2012
  • 卷号:89
  • 页码:99-113
  • DOI:10.4204/EPTCS.89.8
  • 出版社:Open Publishing Association
  • 摘要:This paper explores the well known approximation approach to decide weak bisimilarity of Basic Parallel Processes. We look into how different refinement functions can be used to prove weak bisimilarity decidable for certain subclasses. We also show their limitations for the general case. In particular, we show a lower bound of ω ∗ ω for the approximants which allow weak steps and a lower bound of ω + ω for the approximants that allow sequences of actions. The former lower bound negatively answers the open question of Jančar and Hirshfeld.
国家哲学社会科学文献中心版权所有