Información del autor
Documentos disponibles escritos por este autor (58)
Añadir el resultado a su cesta Hacer una sugerencia Refinar búsqueda
texto impreso
Pure names are identifiers with no relation between them, except equality and inequality. In previous works we have extended P/T nets with the capability of creating and managing pure names, obtaining ?-PNs and proved that they are strictly well[...]texto impreso
Con ocasión del centenario del nacimiento de Alan Turing, y la celebración a nivel internacional de «The Alan Turing Year», con el que se conmemora el mismo a nivel internacional, presentamos una visión personal de su obra, exponiendo de manera [...]texto impreso
We present a new testing semantics, called friendly testing, whose main property is that the induced preorder between processes ?fr is consistent with the conformance relation, and so we have, for instance,a ?b ?fr a ?fr a +b. The new theory is [...]texto impreso
Aceto, Luca ; Frutos Escrig, David de ; Gregorio Rodríguez, Carlos ; Ingolfsdottir, Anna | Springer | 2011Ready simulation has proven to be one of the most significant semantics in process theory. It is at the heart of a number of general results that pave the way to a comprehensive understanding of the spectrum of process semantics. Since its origi[...]texto impreso
This paper is devoted to the study of the (in)equational theory of the largest (pre)congruences over the language BCCSP induced by variations on the classic simulation preorder and equivalence that abstract from internal steps in process behavio[...]texto impreso
Barozzini, David ; Frutos Escrig, David de ; Della Monica, Dario ; Montanari, Angelo ; Sala, Pietro | Elsevier | 2020-04-12In the last years, some extensions of ?-regular languages, namely, ?B-regular (?-regular languages extended with boundedness), ?S-regular (?-regular languages extended with strong unboundedness), and ?BS-regular languages (the combination of ?B-[...]texto impreso
We define (bi)simulations up-to a preorder and show how we can use them to provide a coinductive, (bi)simulation-like, characterisation of semantic (equivalences) preorders for processes. In particular, we can apply our results to all the semant[...]texto impreso
The definition of sos formats ensuring that bisimilarity on closed terms is a congruence has received much attention in the last two decades. For dealing with open terms, the congruence is usually lifted from closed terms by instantiating the fr[...]texto impreso
Coinductive definitions of semantics based on bisimulations have rather pleasant properties and are simple to use. In order to get coinductive characterisations of those semantic equivalences that are weaker than strong bisimulation we use a var[...]texto impreso
Branching bisimilarity and branching bisimilarity with explicit divergences are typically used in process algebras with silent steps when relating implementations to specifications. When an implementation fails to conform to its specification, i[...]texto impreso
n 1976, Plotkin introduced powerdomains adapting to them, in some sense, Egli- Milner's order. Lately, Smyth (1978) presented the same results starting from generating trees, and adding a new order that he denoted by 0. He also gave a characteri[...]texto impreso
There are two ways to define a semantics for process algebras: either directly by means of an equivalence relation or by means of a preorder whose kernel is the desired equivalence. We are interested in the relationship between these two present[...]texto impreso
Bisimulation captures in a coinductive way the quivalence between processes, or trees. Several authors have defined bisimulation distances based on the bisimulation game. However, this approach becomes too local: whenever we have in one of the c[...]texto impreso
This note shows that the complete and the ready simulation preorders do not have a finite inequational basis over the language BCCSP when the set of actions is a singleton. Moreover, the equivalences induced by those preorders do not have a fini[...]texto impreso
Nested simulations define an interesting hierarchy of semantic preorders and equivalences in which every semantics refines the previous one and it is refined by the following. This nested nature provides a fruitful framework for the study of the[...]
