// Average queue size
const double Q;

// Time bound
const int k;

// Minimum energy usage over k time-steps, such that average queue size remains below Q
"num_energy": multi(R{"power"}min=? [ C<=k ], R{"queue"}<=Q*k [ C<=k ])

// Pareto query: minimum energy usage vs minimum average queue size
"pareto": multi(R{"power"}min=? [ C<=k ], R{"queue"}min=? [ C<=k ])