Skip to Main content Skip to Navigation
Conference papers

Generating Linear Invariants for a Conjunction of Automata Constraints

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Ekaterina Arafailova Connect in order to contact the contributor
Submitted on : Wednesday, November 29, 2017 - 11:01:30 AM
Last modification on : Wednesday, October 13, 2021 - 3:52:06 PM


Files produced by the author(s)



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⟩



Record views


Files downloads