 Download Download Presentation 6. Constraint Automata

# 6. Constraint Automata

Télécharger la présentation ## 6. Constraint Automata

- - - - - - - - - - - - - - - - - - - - - - - - - - - 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.