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

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

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

29 Citaten (Scopus)
7 Downloads (Pure)

Samenvatting

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.
Originele taal-2Engels
Pagina's (van-tot)374-378
TijdschriftInformation Processing Letters
Volume108
Nummer van het tijdschrift6
DOI's
StatusGepubliceerd - 2008

Vingerafdruk Duik in de onderzoeksthema's van 'Can I find a partner? Undecidability of partner existence for open nets'. Samen vormen ze een unieke vingerafdruk.

  • Citeer dit