Generating Linear Invariants for a Conjunction of Automata Constraints

Ekaterina Arafailova 1, 2, 3 Nicolas Beldiceanu 1, 2, 3 Helmut Simonis 4, 5
1 TASC - Théorie, Algorithmes et Systèmes en Contraintes
LS2N - Laboratoire des Sciences du Numérique de Nantes
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
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

Collections

CNRS | EC-NANTES | UNAM | UNIV-NANTES | LS2N | LS2N-TASC | IMT-ATLANTIQUE

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

182

Files downloads

147

 

 

Contact

archive-ouverte@inria.fr