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 metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-01651593
Contributor : Ekaterina Arafailova <>
Submitted on : Wednesday, November 29, 2017 - 11:01:30 AM
Last modification on : Tuesday, March 26, 2019 - 9:25:22 AM

File

implied.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01651593, version 1

Citation

Ekaterina Arafailova, Nicolas Beldiceanu, Helmut Simonis. Generating Linear Invariants for a Conjunction of Automata Constraints. The 23rd International Conference on Principles and Practice of Constraint Programming, Aug 2017, Melbourne, Australia. ⟨hal-01651593⟩

Share

Metrics

Record views

182

Files downloads

147