6. Constraint Automata

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
(No Transcript)
3
Be sure to simplify your constraint automaton
using the rules in the textbook.
4

• 6.3 Analysis of Reachable Configurations
• by translation to Datalog with constraints
• Example
• T(d,e,y) T(d,e,y), d ? 100, dd-100,
  ee198.
• T(d,e,y) T(d,e,y), d ? 100, dd-100,
  yy29700.
• T(d,e,y) T(d,e,y), e ? 200, dd99,
  ee-200.
• T(d,e,y) T(d,e,y), e ? 200, ee-200,
  yy29700.
• T(d,e,y) T(d,e,y), y ? 30000, dd99,
  yy-30000.
• T(d,e,y) T(d,e,y), y ? 30000, ee198,
  yy-30000.