The document presents operating guidelines and modeling for finite-state services within the context of service-oriented architecture. It discusses concepts such as service providers, brokers, requesters, and the associated workflows, specifically in relation to a vending machine service model. Additionally, it covers deadlock-free communication, service matching through simulation relations, and provides experimental results on various services.

1. Operating Guidelines for Finite-State Service Karsten Wolf Institut für Informatik Universität Rostock Niels Lohmann, Peter Massuthe Institut für Informatik Humboldt-Universität zu Berlin

2. Part 1 Overview

3. Service Oriented Architecture Service Provider Service Broker Service Requester publish find bind ?

4. Service Oriented Architecture Service Provider Service Broker Service Requester publish find bind signature of interface semantics behaviour non-functional

5. Map to real world Provided service € C T Quit Service requester Public View Coin will fall down Mechanism will activate buttons Pressed button triggers water heating cup is being filled

6. Map to real world Provided service € C T Quit Service requester Operating guideline Insert coin Press button Release cup

7. Service Oriented Architecture Service Provider Service Broker Service Requester publish find bind Operating guideline

8. Part 2 Modeling Services

9. Service Vending machine € C T c/t Quit open workflow net E

10. Service Customer E

11. Composition of services glue interface places state space deadlock: no sucessors, one service not in final marking, remaining messages on channels k-limited communication: never more than k tokens on a message channel correctness: deadlock freedom + k-limited communication, for some given k

12. Behaviour of a single service E      ?q ?e ?c ?t !C !T !E !E Service automaton

13. Obtaining service models BPEL process oWFN Service automaton feature complete PN semantics for BPEL [BPM 2005], [WS-FM 2007] state space of inner(oWFN) Petrinetztheorie „ Regionentheorie“ [Modellierung 2008]

14. Part 3 A canonical partner

15. Partner construction: R*      ?q ?e ?c ?t !C !T !E !E for example: k = 1   c  Construction finite by requirement of k-limited communication ?* * - !c  c !t  t !e  e  !q  ce  c   C  E !c ?C ... ...

16. Canonicity of R* Every deadlock-free and k-limited partner has a simulation relation to R* Every simulation partner has k-limited communication Simulation relation can be easily computed as R* is deterministic but: not every service that has a simulation relation to R* is deadlock-free

17. Part 4 Operating guideline and matching

18. Operating guideline = R* + annotations Annotation = boolean coding of property „no deadlocks here“

19. Experimental Results Tool: FIONA 200 362 215 206 SMTP 0 7 148 187 Registration office 216 280 114 149 Identity card service 7583 54 851 871 Database Service 7 320 534 517 Travel Service 2 8 28 33 Help Desk Service 0 14 15 21 Olive Oil Ordering 0 7 35 48 Loan Approval 0 168 23 38 Purchase Order Time (s) States in OG T P Service

20. Matching = Simulation relation to R* and satisfaction of annotations state of R state of R* !a ∨(?b∧?c) simulation relation !a ?b assignment: a,b: true c: false

21. Applications Service discovery Service validation Service exchangeability ...