You are here

Generating Linear Invariants for a Conjunction of Automata Constraints


We propose a systematic approach for generating linear implied constraints that link the values returned by several automata with accumulators after consuming the same input sequence. The method handles automata whose accumulators are increased by (or reset to) some non-negative integer value on each transition. We evaluate the impact of the generated linear invariants on conjunctions of two families of time-series constraints.

Speaker Name: 
Helmut Simonis
Speaker Bio: 
Senior Research Fellow
Speaker Photo: 
Seminar Date: 
Wednesday, 4 October, 2017 - 15:00 to 16:00
Seminar Location: 
WGB 2.16