%0 Conference Proceedings
%T On Abstraction-Based Deadlock-Analysis in Service-Oriented Systems with Recursion
%+ Martin-Luther-University Halle-Wittenberg
%A Weissbach, Mandy
%A Zimmermann, Wolf
%Z Part 5: Services
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 6th European Conference on Service-Oriented and Cloud Computing (ESOCC)
%C Oslo, Norway
%Y Flavio De Paoli
%Y Stefan Schulte
%Y Einar Broch Johnsen
%I Springer International Publishing
%3 Service-Oriented and Cloud Computing
%V LNCS-10465
%P 168-176
%8 2017-09-27
%D 2017
%R 10.1007/978-3-319-67262-5_13
%K Process rewrite systems
%K Deadlock
%K Workflow nets
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 2
%Z WG 2.14
%2 https://inria.hal.science/hal-01677617/document
%2 https://inria.hal.science/hal-01677617/file/449571_1_En_13_Chapter.pdf
%L hal-01677617
%U https://inria.hal.science/hal-01677617
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-ESOCC
%~ IFIP-TC2
%~ IFIP-WG2-14
%~ IFIP-LNCS-10465