Name
Abstract | ||
|---|---|---|
Constraint automata are the first-proposed operational semantics of Reo coordination language. They can be composed not only by all well-defined composition operators of labeled transition systems but also by two new operators. The new operators are joining of constraint automata with respect to their common port names and hiding a port name in all transition labels. The operations of these two extra operators depend on the internal structures of the transition labels, while in the others each transition label is considered as a simple entity. An equivalence relation between transition systems is a congruence relation if the replacement of the components of a model by the equivalent ones always yields a model that is equivalent with the original one. Obviously, this definition of the congruency depends on the operators which are used to compose the components of models. This paper introduces four congruency results: we prove that failure-based equivalence relation CFFD (chaos-free failures divergences relation) is a congruence relation with respect to joining of constraint automata and also with respect to hiding port names in a constraint automaton. We also show that these are cases for equivalence relation NDFD (non-divergent failures divergences). |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1080/00207160902915886 | Int. J. Comput. Math. |
Keywords | Field | DocType |
failure-based equivalence,failure-based equivalence relation,congruence relation,divergences relation,port name,equivalence relation,new operator,constraint automaton,common port name,transition system,transition label,operational semantics,composition operator,compositional semantics | Constraint automaton,Discrete mathematics,Operational semantics,Equivalence relation,Automaton,Equivalence (measure theory),Operator (computer programming),Congruence relation,Reo Coordination Language,Mathematics | Journal |
Volume | Issue | ISSN |
87 | 11 | 0020-7160 |
Citations | PageRank | References |
1 | 0.35 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Izadi | 1 | 1 | 0.35 |
| A. Movaghar | 2 | 197 | 32.28 |