Constraint automaton
id:
constraint-automaton-263-2061803
title:
Constraint automaton
text:
In computer science, Constraint automata are a formalism to describe the behavior and possible data flow in coordination models. It was introduced by Arbab et al. as a variation of finite automata for model checking Reo connector circuits. Constraint automata can be considered generalizations of probabilistic automata, in which data constraints, instead of probabilities, label state transitions and influence their firing.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Constraint_automaton
date created:
date modified:
2015-11-19T03:28:52Z
main entity:
{"identifier":"Q5164369","url":"https://www.wikidata.org/entity/Q5164369"}
image:
fields total:
13
integrity:
13