Skip to Main content Skip to Navigation
Conference papers

On Abstraction-Based Deadlock-Analysis in Service-Oriented Systems with Recursion

Abstract : We examine deadlock analysis for service-oriented systems with unbound concurrency and unbound recursion. In particular, abstraction-based approaches are considered, i.e., abstract behavior models are derived from service implementations and composed according to the architecture of service-oriented systems. It turns out that there are some limitations of Petri-net-based approaches, e.g., such as workflow nets if deadlocks are analyzed. We show an example that ends in a deadlock if recursion is considered but on a Petri-net-based abstraction, it may regularly end.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01677617
Contributor : Hal Ifip <>
Submitted on : Monday, January 8, 2018 - 3:01:04 PM
Last modification on : Monday, January 8, 2018 - 3:02:57 PM
Long-term archiving on: : Friday, May 4, 2018 - 12:42:07 AM

File

449571_1_En_13_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Mandy Weißbach, Wolf Zimmermann. On Abstraction-Based Deadlock-Analysis in Service-Oriented Systems with Recursion. 6th European Conference on Service-Oriented and Cloud Computing (ESOCC), Sep 2017, Oslo, Norway. pp.168-176, ⟨10.1007/978-3-319-67262-5_13⟩. ⟨hal-01677617⟩

Share

Metrics

Record views

229

Files downloads

100