Generating Linear Invariants for a Conjunction of Automata Constraints

Ekaterina Arafailova (1, 2, 3) , Nicolas Beldiceanu (1, 2, 3) , Helmut Simonis (4, 5)

1 LS2N - équipe TASC - Théorie, Algorithmes et Systèmes en Contraintes
2 LS2N - Laboratoire des Sciences du Numérique de Nantes
3 IMT Atlantique - DAPI - Département Automatique, Productique et Informatique
4 UCC - University College Cork
5 Insight Centre for Data Analytics

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.

Domaines: Informatique [cs]

Ekaterina Arafailova, Nicolas Beldiceanu, Helmut Simonis. Generating Linear Invariants for a Conjunction of Automata Constraints. CP 2017 : 23rd International Conference on Principles and Practice of Constraint Programming, Aug 2017, Melbourne, Australia. ⟨10.1007/978-3-319-66158-2_2⟩. ⟨hal-01651593⟩