有色工作流网的约简规则
Reduction Rules for Colored Workflow Nets
摘要:
本文研究了一种基于数据丰富的工作流网的着色工作流网模型。基于Esparza和Desel[arXiv:1307.2145,arXiv:1403.4958]关于并发协商模型的早期工作,我们提出了模型的约简规则.与以前的工作相反,我们的规则不仅保持健全,而且数据流语义。对于自由选择网,规则将所有健全网(并且仅它们)简化为具有单个转换和相同数据流语义的网。我们给出了一个明确的算法,只需要多项式数量的规则应用程序。
英文摘要:
We study Colored Workflow nets, a model based on Workflow nets enriched with data. Based on earlier work by Esparza and Desel[arXiv:1307.2145,arXiv:1403.4958] on the negotiation model of concurrency, we present reduction rules for our model. Contrary to previous work, our rules preserve not only soundness, but also the data flow semantics. For free choice nets, the rules reduce all sound nets (and only them) to a net with one single transition and the same data flow semantics. We give an explicit algorithm that requires only a polynomial number of rule applications.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。