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
We prove several decidability and undecidability results for ?-PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of reachability, by reducing reachability in nets with inhibitor ar[...]![]()
texto impreso
Timed-arc Petri nets (TAPN’s) are not Turing powerful, because, in particular, they cannot simulate a counter with zero testing. Thus, we could think that this model does not increase significantly the expressiveness of untimed Petri nets. But t[...]![]()
texto impreso
In this paper we study decidability of several extensions of P/T nets with name creation and/or replication. In particular, we study how to restrict the models of RN systems (P/T nets extended with replication, for which reachability is undecida[...]![]()
texto impreso
In previous works we defined ?-APNs, an extension of P/T nets with the capability of creating and managing pure names. We proved that, though reachability is undecidable, coverability remains decidable for them. We also extended P/T nets with th[...]![]()
texto impreso
We prove several decidability and undecidability results for nu-PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of reachability, by reducing reachability in nets with inhibitor a[...]![]()
texto impreso
Recently several authors have proposed some notions of distance between processes that try to quantify “how far away” is a process to be related with some other with respect to a certain semantics. These proposals are usually based on the simula[...]![]()
texto impreso
In this paper we present a denotational semantics for a timed process algebra, which is fully abstract with respect to the must testing semantics previously developed [Lla96,LdFN96]. The domain of semantic processes is made up of consistent sets[...]![]()
texto impreso
Covariant-contravariant simulation and conformance simulation generalize plain simulation and try to capture the fact that it is not always the case that "the larger the number of behaviors, the better". We have previously studied their logical [...]![]()
texto impreso
PBC (Petri Box Calculus) is a process algebra where real parallelism of concurrent systems can be naturally expressed. One of its main features is the definition of a denotational semantics based on Petri nets, which emphasizes the structural as[...]![]()
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 ?-APNs and proved that they are strictly wel[...]![]()
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[...]