1 / 12

MAFSM: From Trees to Graphs

MAFSM: From Trees to Graphs. e. B n. B B. B A. B B B B. B A B A. B A B B. B B B A. . . . . . . . . . . . . MAFSM: From Trees to Graphs. e. B n. B B. B A. B B B B. B A B A. B A B B. B B B A. . . . . . Front ( B n ). . . . . . . .

justus
Download Presentation

MAFSM: From Trees to Graphs

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. MAFSM: From Trees to Graphs e Bn BB BA BBBB BABA BABB BBBA . . . . . . . . . . . .

  2. MAFSM: From Trees to Graphs e Bn BB BA BBBB BABA BABB BBBA . . . . . Front(Bn) . . . . . . .

  3. MAFSM: From Trees to Graphs • We introduce a relationEincluded in Front(Bn )Bn E(BBBA , BA) intuitively means that BBBA and BA are modelled by the same process (they are “behaviourally equivalent”).

  4. MAFSM: From Trees to Graphs • We introduce a relationEincluded in Front(Bn )Bn E(BBBA , BA) intuitively means that BBBA and BA are modelled by the same process (they are “behaviourally equivalent”). Example: E(BBBA , BA) as we assume that A “knows” that B behaves following the protocol. E(BABB ,BA) as we assume that B “knows” that A behaves following the protocol.

  5. MAFSM: From Trees to Graphs e Bn BB BA BBBB BABA BABB BBBA . . . . . Front(Bn) . . . . . . . . .

  6. MAFSM: From Trees to Graphs • We introduce a relationEincluded in Front(Bn )Bn • Edenotes the smallest equivalence relation on B* containing E Example: BAEBBBAEBABBBAE EBBBABBBA BBBA BBEBABBEBBBABBEEBABBBABB BABB

  7. MAFSM: From Trees to Graphs • We introduce a relationEincluded in Front(Bn )Bn • Edenotes the smallest equivalence relation on B* containing E Example: BAEBBBAEBABBBAE EBBBABBBA BBBA BBEBABBEBBBABBEEBABBBABB BABB but BBBB, BABA are not equivalent, via E,to any other viewexceptBBBB, BABA, respectively.

  8. MAFSM: From Trees to Graphs e BA EBBBA BB BABA BABB BBBB . . . . . . . . .

  9. MAFSM: From Trees to Graphs e BA EBBBA BB E BABB BABA BBBB . . . . . .

  10. MAFSM: From Trees to Graphs e BA EBBBA BB E BABB BBf? BABA BBBB . . . . . .

  11. MAFSM: From Trees to Graphs e BA EBBBA BB E BABB BBf? f? BABA BBBB . . . . . .

  12. MultiAgent Finite State Machine Definition: Let {La } be a family of MATL languages on {Pa }. A MAFSM MF=<E, F> where • EFront(Bn)×Bn is functional relation • Fis as defined above

More Related