Simulations Up-to and Canonical Preorders: (Extended Abstract)

d abstract) David de Frutos Escrig1 ,3 Departamento de Sistemas Inform´aticos y Computaci´on Universidad Complutense de Madrid Madrid, Spain Carlos Gregorio Rodr´ıguez2 ,4 Departamento de Sistemas Inform´aticos y Computaci´on Universidad Complutense de Madrid Madrid, Spain In this paper we define simulations up-to a preorder and show how we can use them to provide a coinductive, simulation-like, characterization of semantic preorders for processes. The result applies to a wide class of preorders, in particular to all semantic preorders coarser than the ready simulation preorder in the linear time-branching time spectrum. An interesting but unexpected result is that, when built from an equivalence relation, the simulation up-to is a canonical preorder whose kernel is the given equivalence relation. These canonical preorders have several nice properties, the main being that since all of them are defined in a homogeneous way, their properties can be proved in a generic way. In pa...

• Type: Journal
• Year: 2007
• Where: ENTCS
• Authors: David de Frutos-Escrig, Carlos Gregorio-Rodríguez
• Keywords: Computaci´on Universidad Complutense, ENTCS 2007, Equivalence Relation, Semantic Preorders