Self-management of Machine-to-Machine communications: a multi-models approach

␄㦇 ZKRVH SRVVHVVLRQ DOORZV LWV RZQHU WR EHFRPH D GLYLQH VWUDWHJLVW RU HYHQ D IRXQGHU RI HPSLUH $QRWKHU WKHPH WKDW LV FORVHO\ UHODWHG WR WKH WRQJVX [LDRVKXR ORUH RQ GLYLQDWLRQ LV

3URFHVV FRQWURO GDWD VKRXOG EH XVHG WR LPSURYH RU PDLQWDLQ JRRG SHUIRUPDQFH RI D V\VWHP 'DWD YLVLELOLW\ LV LPSRUWDQW IRU DOO WKH VWDII LQFOXGLQJ VHQLRU ODERUDWRU\ VWDII WKH TXDOLW\

Li frvwv duh qlo/ wkh pdlq fkdqjhv duh lq vroxwlrq wr S 6= lq idfw htxdwlrq +54, ghvfulehv d vlwxdwlrq lq zklfk wkh sulqflsdo ghflghv wr lqyhvw lq LW iru doo w|shv ri djhqwv/ dqg wkh

1 addition: a CREATE call with all required information is sent to the functional layer, more precisely to the resources tree of the device on which the application or the container

A graph grammar is a system <AX; NT; T; P>, where AX is the axiom, NT the set of the non-terminal vertices, T the set of terminal vertices, and P is the set of graph

oj+e,, ri wkh Eùkp wuhh ri x1 L uvw vkrz wkdw +fi wkh sursrvlwlrq 8, li d eudqfk e ri x lv +w> d, xvhixo dqg wkhuh lv d ghfrudwlrq iru +x> e,/ wkhq wkhuh lv d ghfrudwlrq

VWDWH LV FKDUDFWHUL]HG E\ LWV PHDQ YDOXH DQG RYHUVKRRW FRXQWLQJ WKH SHUFHQWDJH RI

0LFURELDO FRPPXQLWLHV KDYH D FHQWUDO UROH LQ HFRV\VWHP SURFHVVHV E\ GULYLQJ WKH (DUWK¶V ELRJHRFKHPLFDO F\FOHV +RZHYHU WKH LPSRUWDQFH RI PLFURELDO GLYHUVLW\ IRU HFRV\VWHP IXQFWLRQLQJ