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

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

doi:10.1016/j.ipl.2008.07.006

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

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

Research output: Contribution to journal › Article › Academic › peer-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 language	English
Pages (from-to)	374-378
Journal	Information Processing Letters
Volume	108
Issue number	6
DOIs	https://doi.org/10.1016/j.ipl.2008.07.006
Publication status	Published - 2008

Access to Document

10.1016/j.ipl.2008.07.006

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

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

@article{645520a7c5d0444a8034f70d2edba9ad,

title = "Can I find a partner? Undecidability of partner existence for open nets",

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.",

author = "P. Massuthe and A. Serebrenik and N. Sidorova and K. Wolf",

year = "2008",

doi = "10.1016/j.ipl.2008.07.006",

language = "English",

volume = "108",

pages = "374--378",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "6",

}

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 -