Skip to search formSkip to main contentSkip to account menu

Constraint automaton

Known as: Constraint automata 
In computer science, Constraint automata are a formalism to describe the behavior and possible data flow in coordination models. It was introduced by… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We present a compositional construction of web services, using Reo and constraint automata as the main “glue” ingredients. Reo is… 
2013
2013
Coordination languages, as Reo, have emerged for the specification and implementation of interaction protocols among concurrent… 
2012
2012
The goal of this thesis is to design an autonomous control system for the sustainable control of buildings. The control system… 
Highly Cited
2009
Highly Cited
2009
In this paper, we present a framework for formal modeling and verification of service-based business processes with focus on… 
2008
2008
The idea of synthesizing state-based models from scenario-based interaction specifications has received much attention in recent… 
2008
2008
Constraint programming often involves global constraints, which have been cataloged in [1] and for which various custom filtering… 
2005
2005
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in MediaObjects… 
2004
2004
Long DNA sequences have to be cut using restriction enzymes into small fragments whose lengths and/or nucleotide sequences can be… 
Highly Cited
2001
Highly Cited
2001
Deductive mode-estimation has become an essential component of robotic space systems, like NASA's deep space probes. Future…