Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.ipl.2008.07.006 | Inf. Process. Lett. |
Keywords | Field | DocType |
business process,partner existence,workflow net,algorithmic solution,earlier work,web service,open net,successful notion,general undecidable,operability problem,relevant language,operability,theory of computation,petri net | Discrete mathematics,Petri net,Algorithmics,Computer science,Process architecture,Operability,Theoretical computer science,Artificial intelligence,Soundness,Workflow,Undecidable problem,Theory of computation | Journal |
Volume | Issue | ISSN |
108 | 6 | 0020-0190 |
Citations | PageRank | References |
21 | 0.90 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Massuthe | 1 | 294 | 14.18 |
| Alexander Serebrenik | 2 | 1745 | 150.69 |
| Natalia Sidorova | 3 | 657 | 54.08 |
| Karsten Wolf | 4 | 757 | 42.53 |