Generating Linear Invariants for a Conjunction of Automata Constraints - Archive ouverte HAL Access content directly
Conference Papers Year :

Generating Linear Invariants for a Conjunction of Automata Constraints

(1, 2, 3) , (1, 2, 3) , (4, 5)
1
2
3
4
5

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.
Fichier principal
Vignette du fichier
implied.pdf (670.92 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

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⟩
110 View
108 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More