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 | 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[...]![]()
texto impreso
n this paper we present a process algebra model of probabilistic communicating processes based on classical CSP. To define our model we have replaced internal non-determinism by generative probabilistic choices, and external non-determinism by r[...]![]()
texto impreso
![]()
texto impreso
![]()
texto impreso
Aceto, Luca ; Frutos Escrig, David de ; Gregorio Rodríguez, Carlos ; Ingolfsdottir, Anna | Springer | 2012This paper presents a complete account of positive and negative results on the finite axiomatizability of weak complete simulation semantics over the language BCCSP. We offer finite (un)conditional ground-complete axiomatizations for the weak co[...]![]()
texto impreso
This note shows that the trace simulation preorder does not have a finite inequational basis over the language BCCSP. Indeed, no collection of sound inequations of bounded depth is ground-complete with respect to the trace simulation preorder ov[...]![]()
texto impreso
Several years before the popularization of the Internet, Mark Weiser proposed the concept of ubiquitous computing with the purpose of enhancing the use of computers by making many computers available throughout the physical environment, but maki[...]![]()
texto impreso
Frutos Escrig, David de ; Gregorio Rodríguez, Carlos ; Palomino, Miguel ; Romero Hernández, David | Tech Univ Braunschweig, Inst Theoretical Computer Sci | 2013Van Glabbeek's linear time-branching time spectrum is one of the most relevant work on comparative study on process semantics, in which semantics are partially ordered by their discrimination power. In this paper we bring forward a refinement of[...]![]()
texto impreso
We present a theoretical framework which allows to define in a uniform way coinductive characterisations of nearly any semantic preorder or equivalence between processes, by means of simulations up-to and bisimulations up-to. In particular, all [...]