Sufficient and necessary condition to decide compatibility for a class of interorganizational workflow nets

DOI10.1155/2015/392945zbMath1394.68255OpenAlexW2115599675WikidataQ59118459 ScholiaQ59118459MaRDI QIDQ1665580

Lijing Chen, GuanJun Liu

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/392945

Mathematics Subject Classification ID

Production models (90B30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of organizations, manpower planning in operations research (90B70)

Uses Software

• ePNK

Cites Work

• Soundness of workflow nets: classification, decidability, and analysis
• Formal methods for web services. 9th international school on formal methods for the design of computer, communication, and software systems, SFM 2009, Bertinoro, Italy, June 1--6, 2009. Advanced lectures
• Structural soundness of workflow nets is decidable
• The ePNK: An Extensible Petri Net Tool for PNML
• Compositional semantics for open Petri nets based on deterministic processes
• Free Choice Petri Nets
• Understanding Petri Nets
• Complexity of the Soundness Problem of Workflow Nets
• Applications and Theory of Petri Nets 2004
• Unnamed Item

This page was built for publication: Sufficient and necessary condition to decide compatibility for a class of interorganizational workflow nets