35:
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
109:
128:
96:
by Sara
Navidpour and Mohammad Izadi, Department of Mathematical Science, Sharif University of Technology, Tehran, Iran.
69:
47:
50:, in which data constraints, instead of probabilities, label state transitions and influence their firing.
74:
28:
64:
36:
59:
40:
122:
93:
106:"Effective Modeling of Software Architectural Assemblies Using Constraint Automata"
17:
105:
46:
Constraint automata can be considered generalizations of
108:
by Nikunj R. Mehta, Marjan
Sirjani, and Farhad Arbab.
94:"Linear Temporal Logic of Constraint Automata"
112:Technical Report SEN-R0309, October 22, 2003.
8:
86:
7:
25:
1:
145:
43:Reo connector circuits.
70:Probabilistic automaton
129:Automata (computation)
48:probabilistic automata
33:Constraint automata
18:Constraint automata
75:Colored Petri net
16:(Redirected from
136:
113:
103:
97:
91:
29:computer science
21:
144:
143:
139:
138:
137:
135:
134:
133:
119:
118:
117:
116:
104:
100:
92:
88:
83:
65:Finite automata
56:
37:finite automata
23:
22:
15:
12:
11:
5:
142:
140:
132:
131:
121:
120:
115:
114:
98:
85:
84:
82:
79:
78:
77:
72:
67:
62:
60:Model checking
55:
52:
41:model checking
24:
14:
13:
10:
9:
6:
4:
3:
2:
141:
130:
127:
126:
124:
111:
107:
102:
99:
95:
90:
87:
80:
76:
73:
71:
68:
66:
63:
61:
58:
57:
53:
51:
49:
44:
42:
38:
34:
30:
19:
101:
89:
45:
32:
26:
81:References
123:Category
54:See also
39:for
110:CWI
27:In
125::
31:,
20:)
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.