首页> 外文OA文献 >A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes

【2h】

A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes

机译：一种确定赋范基本并行过程的互模拟等价的多项式时间算法

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
Yoram Hirshfeld; Mark Jerrum; Faron Moller;
展开▼
作者单位

展开▼
年度 1996
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. Decidability of bisimulation equivalence for normed pushdown processes [J] . Stirling C. Theoretical computer science . 1998,第2期

机译：规范下推过程的双仿真等效性的判定性
2. Non-interleaving bisimulation equivalences on Basic Parallel Processes [J] . Sibylle Froeschle, Petr Jancar, Slawomir Lasota, Information and computation . 2010,第1期

机译：基本并行过程上的非交织双仿真等价
3. Decidability of performance equivalence for basic parallel processes [J] . Slawomir Lasota Theoretical computer science . 2006,第1a3期

机译：基本并行过程的性能等效性的可判定性
4. A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes [C] . Slawomir Lasota, Lecture Notes in Computer Science 2747 International Symposium on Mathematical Foundations of Computer Science . 2003

机译：用于决定基本并行过程真正并发等效性的多项式算法
5. Supervisory control of discrete event systems for bisimulation or simulation equivalence. [D] . Zhou, Changyan. 2007

机译：用于双仿真或仿真等效的离散事件系统的监督控制。
6. Polynomial-Time Algorithms for Building a Consensus MUL-Tree [O] . Yun Cui, Jesper Jansson, Wing-Kin Sung -1

机译：建立共识MUL树的多项式时间算法
7. A Polynomial-Time Algorithm for Deciding TrueConcurrency Equivalences of Basic Parallel Processes [O] . 2008

机译：确定基本并行过程的TrueConcurrency等价的多项式时间算法

A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes

著录项

引文网络

相似文献

相关主题

期刊订阅