Communication Dans Un Congrès Année : 2017

Generating Linear Invariants for a Conjunction of Automata Constraints

Résumé

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.

Fichier principal
Vignette du fichier
implied.pdf (670.92 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-01651593 , version 1 (29-11-2017)

Licence

Identifiants

Citer

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⟩
249 Consultations
431 Téléchargements

Altmetric

Partager

  • More