Download ppt - 6. Constraint Automata

Transcript
Page 1: 6. Constraint Automata

1

6. Constraint AutomataConstraint 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.

Page 2: 6. Constraint Automata

2

Page 3: 6. Constraint Automata

3

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

Page 4: 6. Constraint Automata

4

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.


Recommended