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.
Massuthe, P., Serebrenik, A., Sidorova, N., & Wolf, K. (2008). Can I find a partner? Undecidability of partner existence for open nets. Information Processing Letters, 108(6), 374-378. https://doi.org/10.1016/j.ipl.2008.07.006