09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal...
-
Upload
catherine-marte -
Category
Documents
-
view
216 -
download
2
Transcript of 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal...
![Page 1: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/1.jpg)
09-05-2008
Efficient Controllability Analysis of Open Nets
Workshop on Web Services and Formal Methods 2008
Daniela [email protected]
http://www.service-technology.org/wsfm2008
![Page 2: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/2.jpg)
2
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
Setting
Service self-contained software unit encapsulated functionality with interface designed to interact with other services
service SS interacting withanother serviceservice modeling
![Page 3: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/3.jpg)
3
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
question, whether there exists another service C such that S and C can interact properly
does the composition of S and C reach a final state without deadlocking and no messages are left pending on the interface
interaction is done asynchronously
Controllability
![Page 4: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/4.jpg)
4
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
Model of a Service
a service is modeled as an open net
Petri net with • output (yellow) places,• input (orange) places,• special initial state and
set of final states• acyclic
Example: online portal initial state: [p1] set of final states: {[p5]}
![Page 5: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/5.jpg)
5
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
Using the Online Portal
user as an automaton Interaction Graph
?terms ?note
?stats
!review
!login!login
![Page 6: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/6.jpg)
6
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
Filling out the Bubbles
nodes: set of states transient states, deadlocks
[p1][p4, terms][p2, note]
[p3, stats, note]
?terms
![Page 7: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/7.jpg)
7
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
Filling out the Bubbles
nodes: set of states transient states, deadlocks
[p1][p4, terms][p2, note]
[p3, stats, note]
?terms
!login
[p4]
![Page 8: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/8.jpg)
8
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
Filling out the Bubbles
nodes: set of states transient states, deadlocks
[p1][p4, terms][p2, note]
[p3, stats, note]
?terms
!login
[p4, login][p5]
[p4]
![Page 9: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/9.jpg)
9
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
Filling out the Bubbles
nodes: set of states transient states, deadlocks
[p1][p4, terms][p2, note]
[p3, stats, note]
?terms
[p4, login][p5]
[p4]
!review
...!login
...
?note
...?stats
...
!review... ?terms
...
...
?note
...?stats
...
...
!login
![Page 10: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/10.jpg)
10
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
Interaction Graph of Online Portal
![Page 11: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/11.jpg)
11
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
Interaction Graph of Online Portal
Is our service controllable? Does the IG contain a controller?
Classification of the nodes necessary
![Page 12: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/12.jpg)
12
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
The complete Interaction Graph
for real life services IG grows huge in size industrial service (open net: #P = 116, #E = 156)
complete IG: #Nodes = 1584, #Edges = 7473, time = 302s
solution: define reduction rules! reduced IG: #Nodes = 31, #Edges = 41, time
= 1s
![Page 13: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/13.jpg)
13
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
Activation of Events
state s activates an event a:
state s is a deadlock sending or receiving a
leads from s to a new state [p1]
[p4, terms][p2, note]
[p3, stats, note]
?note
...?stats
!review
...!login
...?terms
!login
[p4]
...
![Page 14: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/14.jpg)
14
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
Receiving before Sending
Idea: do not send anything as long as you can receive something
one state activates a receiving and a sending event
consider the receiving event only
[p1][p4, terms][p2, note]
[p3, stats, note]
?terms
?note
...?stats
...
!review
...!login
...
...
![Page 15: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/15.jpg)
15
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
Reduced Interaction Graph I
![Page 16: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/16.jpg)
16
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
Combining Receiving Events
Idea: receive as much as possible at once
a state activates more than one receiving event
combine all receiving events of one state to one event
[p1][p4, terms][p2, note]
[p3, stats, note]
?terms
?note
...?stats
...
!review
...!login
...
...
![Page 17: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/17.jpg)
17
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
Combining Receiving Events
Idea: receive as much as possible at once
a state activates more than one receiving event
combine all receiving events of one state to one event
[p1][p4, terms][p2, note]
[p3, stats, note]
!review
...!login
...
?stats, ?note
...?terms
...
![Page 18: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/18.jpg)
18
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
Reduced Interaction Graph II
![Page 19: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/19.jpg)
19
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
All Reduction Rules combined
all reduction rules can be combined
![Page 20: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/20.jpg)
20
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
Reduced Interaction Graph III
all reduction rules combined: 6 nodes, 5 edges
full IG: 30 nodes, 31 edges
![Page 21: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/21.jpg)
21
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
Take Home Points
our case studies show reduced interaction graph is an efficient
technique to decide controllability for most services reduction by >90%
IG and all reduction rules are integrated into tool Fiona
http://www.service-technology.org/fiona
![Page 22: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/22.jpg)
22
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
Future Work
define more reduction rules• which events are activated• reduce number of states stored in nodes
adapt techniques to work with cyclic open nets as well
![Page 23: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/23.jpg)
23
Effi
cient C
ontro
llab
ility A
naly
sis of O
pen N
ets
See more
Web http://www.service-technology.org/wsfm2008 slides, paper, tools, examples, ...
![Page 24: 09-05-2008 Efficient Controllability Analysis of Open Nets Workshop on Web Services and Formal Methods 2008 Daniela Weinberg weinberg@informatik.hu-berlin.de.](https://reader036.fdocuments.us/reader036/viewer/2022062712/56649c765503460f9492a9a6/html5/thumbnails/24.jpg)
09-05-2008
Thanks a lot!