Información del autor
Autor Frutos Escrig, David de |
Documentos disponibles escritos por este autor (58)
![](./images/expand_all.gif)
![](./images/collapse_all.gif)
![Selecciones disponibles](./images/orderby_az.gif)
![]()
texto impreso
Aceto , Luca ; Fábregas, Ignacio ; Frutos Escrig, David de ; Ingolfsdottir, Anna ; Palomino, Miguel | EPTCS | 2011Covariant-contravariant simulation is a combination of standard (covariant) simulation, its contravariant counterpart and bisimulation. We have previously studied its logical characterization by means of the covariant-contravariant modal logic. [...]![]()
texto impreso
We present a new testing semantics, called friendly testing, whose main property is that the induced preorder between processes v fr is consistent with the conformance relation, and so we have, for instance, a \Phi b v fr a v fr a + b. The new t[...]![]()
texto impreso
Covariant-contravariant simulation and conformance simulation are two generalizations of the simple notion of simulation which aim at capturing the fact that it is not always the case that “the larger the number of behaviors, the better”. Theref[...]![]()
texto impreso
Our concrete objective is to present both ordinary bisimulations and probabilistic bisimulations in a common coalgebraic framework based on multiset bisimulations. For that we show how to relate the underlying powerset and probabilistic distribu[...]![]()
texto impreso
We study the relationship between name creation and replication in a setting of infinitestate communicating automata. By name creation we mean the capacity of dynamically producing pure names, with no relation between them other than equality or[...]![]()
texto impreso
We study the relationship between name creation and replication in a setting of infinite-state communicating automata. By name creation we mean the capacity of dynamically producing pure names, with no relation between them other than equality o[...]![]()
texto impreso
Bisimulation semantics are a very pleasant way to define the semantics of systems, mainly because the simplicity of their definitions and their nice coalgebraic properties. However, they also have some disadvantages: they are based on a sequenti[...]![]()
texto impreso
We present a study of the notion of coalgebraic simulation introduced by Hughes and Jacobs. Although in their original paper they allow any functorial order in their definition of coalgebraic simulation, for the simulation relations to have good[...]![]()
texto impreso
We study completeness of narrowing strategies for a class of programs defining (possibly partial and non-strict) functions by means of equations, with a lazy semantics, so that infinite values are also admissible. We consider a syntactical restr[...]![]()
texto impreso
In recent papers we have introduced Mobile Synchronizing Petri Nets, a new model for mobility based on coloured Petri Nets. It allows the description of systems composed of a collection of (possibly mobile) hardware devices and mobile agents, bo[...]![]()
texto impreso
Embedded-systems designers often use transition system-based notations for specifying, with respect to some refinement preorder, sets of deterministic implementations. This paper compares popular such refinement settings — ranging from transitio[...]![]()
texto impreso
The complexity of parallel systems has produced a large collection of semantics for processes, a classification of which is provided by Van Glabbeek's linear time-branching time spectrum; however, no suitable unified definitions were available. [...]![]()
texto impreso
We continue with the task of obtaining a unifying view of process semantics by considering in this case the logical characterization of the semantics. We start by considering the classic linear time-branching time spectrum developed by R.J. van [...]![]()
texto impreso
The complexity of parallel systems has produced a large collection of semantics for processes. Van Glabbeek’s linear time-branching time spectrum provides a classification of most of these semantics; however, no suitable unified definitions were[...]![]()
texto impreso
We present a model of probabilistic processes, which is an extension of CSP, on the basis of replacing internal non-determinism by generative probabilistic choices, and external non-determinism by reactive probabilistic choices. Our purpose when[...]![]()
texto impreso
This paper addresses the study of bisimulation based conformance relations in which input and output actions not presented in the specification are added to the implementation. A new definition, that we called soft conformance, is given. Then, w[...]![]()
texto impreso
We present probabilistic Ianov's schemes, studying their semantics and proving the equivalence between operational and denotational ones. We also study the equivalence of schemes relative to them; as usual all these equivalence problems are deci[...]![]()
texto impreso
Frutos Escrig, David de ; Gregorio Rodríguez, Carlos | Graz Univ. Technolgoy, Inst. Information Systems Computer Med. | 2006Bisimulation can be defined in a simple way using coinductive methods, and has rather pleasant properties. Ready similarity was proposed by Meyer et al. as a way to weakening the bisimulation equivalence thus getting a semantics defined in a sim[...]![]()
texto impreso
There have been quite a few proposals for behavioural equivalences for concurrent processes, and many of them are presented in Van Glabbeek’s linear time-branching time spectrum. Since their original definitions are based on rather different ide[...]![]()
texto impreso
Our objective is to extend the standard results of preservation and reflection of properties by bisimulations to the coalgebraic setting, as well as to study under what conditions these results hold for simulations. The notion of bisimulation is[...]![]()
texto impreso
Aceto, Luca ; Fábregas, Ignacio ; Frutos Escrig, David de ; Ingolfsdottir, Anna ; Palomino, Miguel | Springer | 2012This paper studies the relationships between three notions of behavioural preorder that have been proposed in the literature: refinement over modal transition systems, and the covariant-contravariant simulation and the partial bisimulation preor[...]![]()
texto impreso
Recently we have introduced Ambient Petri nets, as a multilevel extension of the Elementary Object Systems, that can be used to model the concept of nested ambients from the Ambient Calculus. Both mobile computing and mobile computation are supp[...]![]()
texto impreso
In reversible computations one is interested in the development of mechanisms allowing to undo the effects of executed actions. The past research has been concerned mainly with reversing single actions. In this paper, we consider the problem of [...]![]()
texto impreso
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 [...]![]()
texto impreso
We define and study some definitions of probabilistic powerdomains over domains in SFP. We give three definitions: the first one is based in the notion of probability distribution over a domain; the second in probabilistic generating trees, that[...]