A stubborn attack on state explosion
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Stubborn Sets for Standard Properties
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Analyzing interacting WS-BPEL processes using flexible model generation
Data & Knowledge Engineering
Operating guidelines for finite-state services
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Analyzing interacting BPEL processes
BPM'06 Proceedings of the 4th international conference on Business Process Management
Analyzing web service based business processes
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Why Does My Service Have No Partners?
Web Services and Formal Methods
How to implement a theory of correctness in the area of business processes and services
BPM'10 Proceedings of the 8th international conference on Business process management
Wendy: a tool to synthesize partners for services
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Wendy: A Tool to Synthesize Partners for Services
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
Analyzing business process architectures
CAiSE'13 Proceedings of the 25th international conference on Advanced Information Systems Engineering
Business process architectures with multiplicities: transformation and correctness
BPM'13 Proceedings of the 11th international conference on Business Process Management
| Hi-index | 0.00 |
A service is designed to interact with other services. If the service interaction is stateful and asynchronous, the interaction protocol can become quite complex. A service may be able to interact with a lot of possible partner services, one partner or no partner at all. Having no partner surely is not intended by the designer. But the stateful interaction between services can be formalized and thus analyzed at design time. We present a formalization which is centered around a graph data structure that we call interaction graph , which represents feasible runs of a partner service according to the interaction protocol. As interaction graphs suffer from state explosion, we introduce a set of suitable reduction rules to alleviate the complexity of our approach. As our case studies show we are able to analyze the interaction behavior of a service efficiently.