| Title | Congruence results for a family of unary operators |
| Publication Type | Conference Paper |
| Year of Publication | 1994 |
| Authors | D'Argenio, PR, Echagüe, JV, Pertino, C |
| Conference Name | Proc. of SCCC XXI, Santiago de Chile |
| Abstract | We are interested in the semantics of reactive systems. We deal with the family of the n-nested simulation equivalences on Labelled Transition Systems (LTS). In [DEP94] we have shown that priority operators are not compatible with these equivalences
In this paper we study a large class of U of static unary operators over the LTS, to which hiding, relabelling and priority operators belong to. We show that ready-simulation and bisimulation equivalences are congruences for all members of U. This is not the case for the n-nested simulation equivalence, for which only monotonic operators are compatible.
We also introduce a new family of semantic equivalences over LTSs, the n-nested ready simulation equivalences which are congruences for all the operators in U. This family is strictly finner than the coarsest congruence congruence for the U operators contained in n-nested equivalences. |