You are here

Generating Linear Invariants for a Conjunction of Automata Constraints

Authors: 

Ekaterina Arafailova, Nicolas Beldiceanu, Helmut Simonis

Publication Type: 
Refereed Conference Meeting Proceeding
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 timeseries constraints
Conference Name: 
CP 2017
Proceedings: 
CP 2017, International Conference on Principles and Practice of Constraint Programming
Digital Object Identifer (DOI): 
10.1007/978-3-319-66158-2_2
Publication Date: 
29/08/2017
Volume: 
LNCS 10416
Pages: 
21-37
Conference Location: 
Australia
Research Group: 
Institution: 
National University of Ireland, Cork (UCC)
Project Acknowledges: 
Open access repository: 
No
Publication document: