1 / 25

Translating from logic to automata Book: Chapter 6

Translating from logic to automata Book: Chapter 6. Why translating?. Want to write the specification in some logic. Want model-checking tools to be able to check the specification automatically. Preprocessing. Convert into normal form, where negation only applies to propositional variables.

marlee
Télécharger la présentation

Translating from logic to automata Book: Chapter 6

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. Translating from logic to automataBook: Chapter 6

  2. Why translating? • Want to write the specification in some logic. • Want model-checking tools to be able to check the specification automatically.

  3. Preprocessing • Convert into normal form, where negation only applies to propositional variables. • ¬[] becomes <>¬. • ¬<> becomes [] ¬. • What about ¬ ( U )? • Define operator V such that¬ (  U ) = (¬) V (¬), ¬ (  V ) = (¬) U (¬).

  4. Semantics of pVq ¬p ¬p ¬p ¬p ¬p ¬p ¬p ¬p ¬p q q q q q q q q q ¬p ¬p ¬p ¬p p q q q q q

  5. Replace ¬T by F, and ¬F by T. • Replace ¬ ( \/ ) by (¬) /\ (¬) and¬ ( /\ ) by (¬) \/ (¬)

  6. Eliminate implications, <>, [] • Replace  ->  by (¬) \/ . • Replace <> by (T U ). • Replace [] by (F V ).

  7. Example • Translate ( []<>P ) -> ( []<>Q ) • Eliminate implication ¬( []<>P ) \/ ( []<>Q ) • Eliminate [], <>:¬( F V ( T U P ) ) \/ ( F V ( T U Q ) ) • Push negation inwards:(T U (F U ¬ P ) ) \/ ( F V ( T U Q ) )

  8. Incoming New Old Next The data structure Name

  9. The main idea •  U  =  \/ (  /\ O (  U  ) ) •  V  =  /\ (  \/ O (  V  ) ) This separates the formulas to two parts:one holds in the current state, and the otherin the next state.

  10. How to translate? • Take one formula from “New” and add it to “Old”. • According to the formula, either • Split the current node into two, or • Evolve the node into a new version.

  11. Incoming New Old Next Incoming Incoming New Old New Old Next Next Splitting Copy incoming edges, update other field.

  12. Incoming New Old Next Incoming New Old Next Evolving Copy incoming edges, update other field.

  13. Possible cases: •  U  , split: • Add  to New, add  U  to Next. • Add  to New. Because  U  =  \/ (  /\ O ( U  )). •  V  , split: • Add  to New. • Add  to New,  V  to Next. Because  V  =  /\ (  \/ O ( V  )).

  14. More cases: •  \/ , split: • Add  to New. • Add  to New. •  /\ , evolve: • Add  to New. • O , evolve: • Add  to Next.

  15. How to start? init Incoming New Old aU(bUc) Next

  16. Incoming Incoming a aU(bUc) bUc aU(bUc) aU(bUc) init Incoming aU(bUc) init init

  17. Incoming bUc aU(bUc) init init Incoming Incoming b aU(bUc) c aU(bUc) (bUc)

  18. When to stop splitting? • When “New” is empty. • Then compare against a list of existing nodes “Nodes”: • If such a with same “Old”, “Next” exists,just add the incoming edges of the new versionto the old one. • Otherwise, add the node to “Nodes”. Generate a successor with “New” set to “Next” of father.

  19. init Incoming a,aU(bUc) Creating a successor node. aU(bUc) Incoming aU(bUc)

  20. Incoming New Old Next How to obtain the automaton? X There is an edge from node X to Y labeled with propositions P (negated or non negated), if X is in the incoming list of Y, and Y has propositions P in field “Old”. Initial node is init. a, b, ¬c Node Y

  21. a, aU(bUc) b, bUc, aU(bUc) c, bUc, aU(bUc) b, bUc c, bUc The resulted nodes.

  22. a, aU(bUc) b, bUc, aU(bUc) c, bUc, aU(bUc) b, bUc c, bUc All nodes with incoming edge from “init”.

  23. Acceptance conditions • Use “generalized Buchi automata”, wherethere are several acceptance sets F1, F2, …, Fn, and each accepted infinite sequence must include at least one state from each set infinitely often. • Each set corresponds to a subformula of form U. Guarantees that it is never the case that U holds forever, without .

  24. a, aU(bUc) b, bUc, aU(bUc) c, bUc, aU(bUc) b, bUc c, bUc All nodes with c, or without bUc. Accepting w.r.t. bUc

  25. a, aU(bUc) b, bUc, aU(bUc) c, bUc, aU(bUc) b, bUc c, bUc All nodes with bUc or without aU(bUc). Acceptance w.r.t. aU(bUc)

More Related