Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Constraint automaton
open-in-new
<p>In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, 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 <a href="/facts/Finite_automata/GMusWd0a">finite automata</a> for <a href="/facts/Model_checking/FwvKMlw9">model checking</a> Reo connector circuits. </p><p>Constraint automata can be considered generalizations of <a href="/facts/Probabilistic_automaton/clVTVeTf">probabilistic automata</a>, in which data constraints, instead of probabilities, label state transitions and influence their firing. </p>