40
CS269: HW/SW Engineering of Embedded Systems, Winter02
Logic Of Constraints syntax
•Given an algebra with sorts, e.g. {Integers, Reals, ...}, and operators and relations on sorts, e.g. {+, -, *, ...}, and  {<, >, ...}
•terms are
•constants of any sort
• variable i
•e[t], a(e[t]), where e is  event, a is annotation, t is term
•expressions with operators, e.g. y[i+2]-a(x[i])
•LOC formulas are
•expressions with relations, e.g x[i]>y[i+2]
•Boolean combinations of formulas