Highlights • We extend constraint automata to compactly deal with infinite data domains. • We define foundational notions as behavior, equivalence, congruence, composition. • We present a new approach to composing a set of constraint automata. • We compare the new approach to the existing approach in a number of experiments
AbstractA compositional and fully abstract semantics for concurrent constraint programming is develo...
International audienceConsider a constraint on a sequence of variables functionally determining a re...
Abstract Matrix models are ubiquitous for constraint problems. Many such prob-lems have a matrix of ...
Highlights• We extend constraint automata to compactly deal with infinite data domains.• We define f...
textabstractThe grand composition of n automata may have a number of states/transitions exponential ...
Constraint programming (CP) is a technology in which a combinatorial problem is modelled as a conjun...
Constraint automata (CA) constitute a coordination model based on finite automata on infinite words....
International audienceWe introduce the class of tree constraint automata with data values in ℤ (equi...
textabstractThe grand composition of n automata may have a number of states/transitions exponential ...
We revise soft constraint automata, wherein transitions are weighted and each action has an associat...
We introduce the class of tree constraint automata with data values in ? (equipped with the less tha...
AbstractReo is a coordination language for modeling component connectors of component-based computin...
We address the problem of the specification and the proof of properties of concurrent systems which ...
We study the expressiveness and complexity of concurrent constraint programming languages over finit...
Contrary to the standard approach consisting in introducing ad hoc constraints and designing dedicat...
AbstractA compositional and fully abstract semantics for concurrent constraint programming is develo...
International audienceConsider a constraint on a sequence of variables functionally determining a re...
Abstract Matrix models are ubiquitous for constraint problems. Many such prob-lems have a matrix of ...
Highlights• We extend constraint automata to compactly deal with infinite data domains.• We define f...
textabstractThe grand composition of n automata may have a number of states/transitions exponential ...
Constraint programming (CP) is a technology in which a combinatorial problem is modelled as a conjun...
Constraint automata (CA) constitute a coordination model based on finite automata on infinite words....
International audienceWe introduce the class of tree constraint automata with data values in ℤ (equi...
textabstractThe grand composition of n automata may have a number of states/transitions exponential ...
We revise soft constraint automata, wherein transitions are weighted and each action has an associat...
We introduce the class of tree constraint automata with data values in ? (equipped with the less tha...
AbstractReo is a coordination language for modeling component connectors of component-based computin...
We address the problem of the specification and the proof of properties of concurrent systems which ...
We study the expressiveness and complexity of concurrent constraint programming languages over finit...
Contrary to the standard approach consisting in introducing ad hoc constraints and designing dedicat...
AbstractA compositional and fully abstract semantics for concurrent constraint programming is develo...
International audienceConsider a constraint on a sequence of variables functionally determining a re...
Abstract Matrix models are ubiquitous for constraint problems. Many such prob-lems have a matrix of ...
DOI
Add to ORKG