1 / 3

Automata Theoretic Approach for System Design Verification

Explore Buchi Automata formalism in checking system property satisfaction, transformation, containment, and verification using Vered Gafni's Model Checker. Assignment #4 tasks about language acceptance by automata.

lixue
Télécharger la présentation

Automata Theoretic Approach for System Design Verification

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. D  yes, no (why ?) D Automata-Theoretic approach • Underlying formalism: Buchi Automata (BA) - infinite words. • Given system design D that is supposed to satisfy property : • Transform  into equivalent BAA • Transform D into equivalent BAAsys • Check containment L(Asys)L(A). Model Checker Vered Gafni, TAU

  2. RTS Development by the Formal Approach Assignment #4 Prove that the language (r+q)*r accepted by the Buchi automaton below is not accepted by any deterministic -automaton Hint: Observe this language accepts traces with finitely many q’s. Try to prove by contradiction. Vered Gafni, TAU

More Related