1 / 4

6. Constraint Automata

6. Constraint Automata. Constraint Automaton – set of states, set of state variables, transitions between states, domain of state variables, and initial values of state variables. Transition – ground constraints ? assignment statements

cutler
Download Presentation

6. Constraint Automata

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. 6. Constraint Automata Constraint Automaton – set of states, set of state variables, transitions between states, domain of state variables, and initial values of state variables. Transition – ground constraints ? assignment statements Ground constraint– has to be satisfied for transition to occur. Assignment statement– changes a state variable.

  2. Be sure to simplify your constraint automaton using the rules in the textbook.

  3. 6.3 Analysis of Reachable Configurations by translation to Datalog with constraints Example: T(d’,e’,y):– T(d,e,y), d  100, d’=d-100, e’=e+198. T(d’,e,y’):– T(d,e,y), d  100, d’=d-100, y’=y+29700. T(d’,e’,y):– T(d,e,y), e  200, d’=d+99, e’=e-200. T(d,e’,y’):– T(d,e,y), e  200, e’=e-200, y’=y+29700. T(d’,e,y’):– T(d,e,y), y  30000, d’=d+99, y’=y-30000. T(d,e’,y’):– T(d,e,y), y  30000, e’=e+198, y’=y-30000.

More Related