Constraint automaton

In computer science, Constraint automata are formalisms to describe the behavior and possible data flow in coordination models^[1]. It was introduced by Arabab et al^[2] as a finite automata for model checking Reo connector circuits. Constraint automata can be considered generalizations of Probabilistic automaton, where data constraints, instead of probabilities, label state transitions and influence their firing.

Reference

^ "Linear Temporal Logic of Constraint Automata" by Sara Navidpour and Mohammad Izadi, Department of Mathematical Science, Sharif University of Technology, Tehran, Iran.
^ "Effective Modeling of Software Architectural Assemblies Using Constraint Automata" by Nikunj R. Mehta, University of Southern California, 941 W.37th Pl., Los Angeles, CA 90048, USA.

[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, University of Southern California, 941 W.37th Pl., Los Angeles, CA 90048, USA.

[1]

[2]

See also

Reference