Can I find a partner? Undecidability of partner existence for open nets

P. Massuthe, A. Serebrenik, N. Sidorova, K. Wolf

Research output: Contribution to journalArticleAcademicpeer-review

29 Citations (Scopus)
7 Downloads (Pure)

Abstract

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.
Original languageEnglish
Pages (from-to)374-378
JournalInformation Processing Letters
Volume108
Issue number6
DOIs
Publication statusPublished - 2008

Fingerprint Dive into the research topics of 'Can I find a partner? Undecidability of partner existence for open nets'. Together they form a unique fingerprint.

  • Cite this