TY - JOUR
T1 - Can I find a partner? Undecidability of partner existence for open nets
AU - Massuthe, P.
AU - Serebrenik, A.
AU - Sidorova, N.
AU - Wolf, K.
PY - 2008
Y1 - 2008
N2 - We study open nets as Petri net models of web services, with a link to the practically relevant language WS-BPEL. For those nets, we investigate the problem of operability which we consider as fundamental as the successful notion of soundness for workflow nets, i.e., Petri net models of business processes and workflows. While we could give algorithmic solutions to the operability problem for subclasses of open nets in earlier work, this article shows that the problem is in general undecidable.
AB - We study open nets as Petri net models of web services, with a link to the practically relevant language WS-BPEL. For those nets, we investigate the problem of operability which we consider as fundamental as the successful notion of soundness for workflow nets, i.e., Petri net models of business processes and workflows. While we could give algorithmic solutions to the operability problem for subclasses of open nets in earlier work, this article shows that the problem is in general undecidable.
U2 - 10.1016/j.ipl.2008.07.006
DO - 10.1016/j.ipl.2008.07.006
M3 - Article
VL - 108
SP - 374
EP - 378
JO - Information Processing Letters
JF - Information Processing Letters
SN - 0020-0190
IS - 6
ER -