位置：成果数据库 > 期刊 > 期刊详情页
Some Complexity Results for the Soundness Problem of Workflow Nets
  • ISSN号：1939-1374
  • 期刊名称：IEEE Transactions on Services Computing
  • 时间：2014.6
  • 页码：322-328
  • 相关项目：交互式Petri网及其兼容性研究
作者： Guanjun Liu|
同期刊论文项目
交互式Petri网及其兼容性研究
期刊论文 18 会议论文 1
同项目期刊论文
The liveness of WS3PR: complexity and decision
Complexity of the soundness problem of bounded workflow nets
An improved attrack tree algorithm based on Android
Sufficient and Necessary Condition for Compatibility of A Class of Interorganizational Workflow Nets
Co-NP-hardness of the soundness problem for asymmetric-choice workflow nets
Complexity of the Soundness Problem of Workflow Nets
Net-structure-based conditions to decide compatibility and weak compatibility for a class of inter-o
The Liveness of (WSPR)-P-3: Complexity and Decision
基于服务簇的Web服务绑定方法
Deciding the liveness for a subclass of weighted Petri nets based on structurally circular wait
A Novel Method for Calculating Service Reputation
逻辑Petri网的S-组合及活性分析