Constraint automaton

In computer science, Constraint automata are a formalism to describe the behavior and possible data flow in coordination models.[1] It was introduced by Arbab et al.[2] 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.

See also

References
  1. "Linear Temporal Logic of Constraint Automata" by Sara Navidpour and Mohammad Izadi, Department of Mathematical Science, Sharif University of Technology, Tehran, Iran.
  2. "Effective Modeling of Software Architectural Assemblies Using Constraint Automata" by Nikunj R. Mehta, Marjan Sirjani, and Farhad Arbab. CWI Technical Report SEN-R0309, October 22, 2003.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.