Exploiting the hierarchical structure of rule-based specifications for decision planning Alberto Lluch Artur Boronat Roberto Bruni Ugo Montanari Generoso Paolillo IFIP International Conference on Formal T echniques for Distributed Systems June 7 – 10, 2010, Amsterdam
MOF UML RS TRANSFORMATION CD1 CD2 REFACTORING RECONFIGURATION OC1 OC2
MOF UML RS TRANSFORMATION Rewriting Logic Semantics [Boronat,Meseguer @FASE'08] CD1 CD2 REFACTORING RECONFIGURATION OC1 OC2
MOF UML RS TRANSFORMATION Rewriting Logic Semantics [Boronat,Meseguer @FASE'08] CD1 CD2 REFACTORING RECONFIGURATION OC1 OC2 MOMENT2=ECLIPSE+MAUDE
a
a [G(a)] | [H(a)]
a [G(a)] | [H(a)] SOS-like rules
a [G(a)] | [H(a)] SOS-like rules MAUDE
a [G(a)] | [H(a)] ADR [Montanari, Bruni, Lluch, SOS-like rules Gadducci, Tuosto, etc. @TGC'10] MAUDE
1 contains
1 contains 2
1 contains 2 3 q
1 contains 2 3 q
0..1 0..* A B
BOX contains color: ●●●... points
a b < a:Box | content:b > , < b:Box | container:a >
a b < a:Box | content:b > , < b:Box | container:a > < a : Box | a < b : Box > b >
Object Collections (flat graphs) Conformant
Object Collections (flat graphs) Nested Object Collections (hierarchical graphs) Conformant Conformant
1 contains 2 3 q
WHICH STYLE IS BEST?
vs
vs
SPO e PURE m SOS i t LOCAL SOS 2 4 2 5 2 6
1 contains 2 3 q
?
? or ?
1 2
a
a b
a b a+b
1$,2h 2$,1h
a,b c,d a+c,max(c,d)
< A , + , x , 0 , 1 > < Domain , choose , combine , worst , best > < Nat ∞ , min , + , ∞ , 0 > < [0,1] , min , max , 0 , 1 > < Bool , or , and , false , true >
< A , + , x , 0 , 1 > < Domain , choose , combine , worst , best > < Nat ∞ , min , + , ∞ , 0 > < [0,1] , min , max , 0 , 1 > < Bool , or , and , false , true >
<A,+,x,0,1> X <B,+,x,0,1> = < AxB, (+,+), (x,x), (0,0), (1,1) >
e d c b
a b a x b
IMPLEMENTATION NOTES
Object Configuration Module Nested Object Configuration Module Rewrite rules STATE SPACE
MOMENT2 http://www.cs.le.ac.uk/people/aboronat/tools/moment2-gt/ FRONT-END INTERFACE MAUDE BACK-END
MOMENT2 http://www.cs.le.ac.uk/people/aboronat/tools/moment2-gt/ FRONT-END INTERFACE proof of MAUDE BACK-END concept
MOMENT2 http://www.cs.le.ac.uk/people/aboronat/tools/moment2-gt/ ??? FRONT-END INTERFACE proof of MAUDE BACK-END concept
UML UML RDBS
SPO UML UML RDBS S O S
CONCLUSION
FLAT HIERARCHICAL
FLAT HIERARCHICAL SPO/REDUCTION CRL/SOS
FLAT HIERARCHICAL SPO/REDUCTION CRL/SOS QUALITATIVE QUANTITATIVE
FLAT HIERARCHICAL SPO/REDUCTION CRL/SOS QUALITATIVE QUANTITATIVE Composition-free Composition-driven
FLAT HIERARCHICAL SPO/REDUCTION CRL/SOS QUALITATIVE QUANTITATIVE Composition-free Composition-driven Sequences Trees
FLAT HIERARCHICAL SPO/REDUCTION CRL/SOS QUALITATIVE QUANTITATIVE Composition-free Composition-driven Sequences Trees Any choice Quantitative choice
FLAT HIERARCHICAL SPO/REDUCTION CRL/SOS QUALITATIVE QUANTITATIVE Composition-free Composition-driven Sequences Trees Any choice Quantitative choice RL/Maude ...RL/Maude!
THANKS!
alberto.lluch@imtlucca.it linkedin.com/in/albertolluch
Recommend
More recommend