... Page 3. 167 Definition 1. A commutation relation over A is a finite set of pairs (u, v) with ... more ... Page 3. 167 Definition 1. A commutation relation over A is a finite set of pairs (u, v) with u and via A* and such that, for any a in A, lula = tvt~. ... P l - h ..... P2 b " P a ~ P4 ..... x ~ P5 (a) b j y 4 P3 ..... P4 ..... P C ." P lh ..... P2 b " P3 c " P4 ..... P5 Fig. 4. Potential bridges. ...
ABSTRACT We considerer the families of languages produced by two-way transducers, and prove itera... more ABSTRACT We considerer the families of languages produced by two-way transducers, and prove iteration lemmas for them. Thus it is shown that the Dyck language D 1 * doesn't belong to the deterministic family, and consequently that the Dyck language D 2 * doesn't belong to the non-deterministic one. Therefore the Dyck language D 1 * is not an EDTOL language.
In this paper we show that, in terms of generated output languages, non-deterministic \textit{pop... more In this paper we show that, in terms of generated output languages, non-deterministic \textit{population protocols} are strictly more powerful than deterministic ones. Analyzing the reason for this negative result, we propose two slightly enhanced models, in which non-deterministic population protocols can be \emph{exactly} simulated by deterministic ones. First, we consider a model in which interactions are not only between couples of agents, but also between triples and in which non-uniform initial states are allowed. We generalize this transformation and we prove a general property for a model with interactions between any number of agents. Second, we simulate any non-deterministic population protocol by a deterministic one in a model where a \emph{configuration} can have an \textit{empty output}. Non-deterministic and deterministic population protocols are then compared in terms of inclusion of their output languages, that is, in terms of solvability of problems. Two transformat...
Mobile sensor networks have been studied using population protocols in (2). In this model, a coll... more Mobile sensor networks have been studied using population protocols in (2). In this model, a collection of agents (called petrels in this paper) are described as finite state machines moving unpredictably around. They can have two kinds of interactions, only with a fixed antenna, or with each other petrels. The goal of the precedent jobs have been to compute the
... A Tutorial Overview 3 Stephan Merz (Universitat Miinchen, Germany) Theorem Proving for Verifi... more ... A Tutorial Overview 3 Stephan Merz (Universitat Miinchen, Germany) Theorem Proving for Verification 39 John Rushby (Computer Science ... Thomas Hune (Aarhus University, Denmark), Bertrand Jeannet, Kim G. Larsen (Aalborg University, Denmark), M. Oliver Moller (Aarhus ...
état des lieux de la présence des femmes en informatique dans l'enseignement supérieur et la ... more état des lieux de la présence des femmes en informatique dans l'enseignement supérieur et la recherche
ABSTRACT We considerer the families of languages produced by two-way transducers, and prove itera... more ABSTRACT We considerer the families of languages produced by two-way transducers, and prove iteration lemmas for them. Thus it is shown that the Dyck language D 1 * doesn't belong to the deterministic family, and consequently that the Dyck language D 2 * doesn't belong to the non-deterministic one. Therefore the Dyck language D 1 * is not an EDTOL language.
... Page 3. 167 Definition 1. A commutation relation over A is a finite set of pairs (u, v) with ... more ... Page 3. 167 Definition 1. A commutation relation over A is a finite set of pairs (u, v) with u and via A* and such that, for any a in A, lula = tvt~. ... P l - h ..... P2 b " P a ~ P4 ..... x ~ P5 (a) b j y 4 P3 ..... P4 ..... P C ." P lh ..... P2 b " P3 c " P4 ..... P5 Fig. 4. Potential bridges. ...
Considering a network of communicating finite state machines which exchange messages over Channel... more Considering a network of communicating finite state machines which exchange messages over Channels, we discuss the distributed termination problem in the more general context of asynchronous environment. We first whow that this problem is undecidable. Then we discuss the possibility of superimposing algorithms that detect termination. At least we examine the case of faulty processors.
... Page 3. 167 Definition 1. A commutation relation over A is a finite set of pairs (u, v) with ... more ... Page 3. 167 Definition 1. A commutation relation over A is a finite set of pairs (u, v) with u and via A* and such that, for any a in A, lula = tvt~. ... P l - h ..... P2 b " P a ~ P4 ..... x ~ P5 (a) b j y 4 P3 ..... P4 ..... P C ." P lh ..... P2 b " P3 c " P4 ..... P5 Fig. 4. Potential bridges. ...
ABSTRACT We considerer the families of languages produced by two-way transducers, and prove itera... more ABSTRACT We considerer the families of languages produced by two-way transducers, and prove iteration lemmas for them. Thus it is shown that the Dyck language D 1 * doesn't belong to the deterministic family, and consequently that the Dyck language D 2 * doesn't belong to the non-deterministic one. Therefore the Dyck language D 1 * is not an EDTOL language.
In this paper we show that, in terms of generated output languages, non-deterministic \textit{pop... more In this paper we show that, in terms of generated output languages, non-deterministic \textit{population protocols} are strictly more powerful than deterministic ones. Analyzing the reason for this negative result, we propose two slightly enhanced models, in which non-deterministic population protocols can be \emph{exactly} simulated by deterministic ones. First, we consider a model in which interactions are not only between couples of agents, but also between triples and in which non-uniform initial states are allowed. We generalize this transformation and we prove a general property for a model with interactions between any number of agents. Second, we simulate any non-deterministic population protocol by a deterministic one in a model where a \emph{configuration} can have an \textit{empty output}. Non-deterministic and deterministic population protocols are then compared in terms of inclusion of their output languages, that is, in terms of solvability of problems. Two transformat...
Mobile sensor networks have been studied using population protocols in (2). In this model, a coll... more Mobile sensor networks have been studied using population protocols in (2). In this model, a collection of agents (called petrels in this paper) are described as finite state machines moving unpredictably around. They can have two kinds of interactions, only with a fixed antenna, or with each other petrels. The goal of the precedent jobs have been to compute the
... A Tutorial Overview 3 Stephan Merz (Universitat Miinchen, Germany) Theorem Proving for Verifi... more ... A Tutorial Overview 3 Stephan Merz (Universitat Miinchen, Germany) Theorem Proving for Verification 39 John Rushby (Computer Science ... Thomas Hune (Aarhus University, Denmark), Bertrand Jeannet, Kim G. Larsen (Aalborg University, Denmark), M. Oliver Moller (Aarhus ...
état des lieux de la présence des femmes en informatique dans l'enseignement supérieur et la ... more état des lieux de la présence des femmes en informatique dans l'enseignement supérieur et la recherche
ABSTRACT We considerer the families of languages produced by two-way transducers, and prove itera... more ABSTRACT We considerer the families of languages produced by two-way transducers, and prove iteration lemmas for them. Thus it is shown that the Dyck language D 1 * doesn't belong to the deterministic family, and consequently that the Dyck language D 2 * doesn't belong to the non-deterministic one. Therefore the Dyck language D 1 * is not an EDTOL language.
... Page 3. 167 Definition 1. A commutation relation over A is a finite set of pairs (u, v) with ... more ... Page 3. 167 Definition 1. A commutation relation over A is a finite set of pairs (u, v) with u and via A* and such that, for any a in A, lula = tvt~. ... P l - h ..... P2 b " P a ~ P4 ..... x ~ P5 (a) b j y 4 P3 ..... P4 ..... P C ." P lh ..... P2 b " P3 c " P4 ..... P5 Fig. 4. Potential bridges. ...
Considering a network of communicating finite state machines which exchange messages over Channel... more Considering a network of communicating finite state machines which exchange messages over Channels, we discuss the distributed termination problem in the more general context of asynchronous environment. We first whow that this problem is undecidable. Then we discuss the possibility of superimposing algorithms that detect termination. At least we examine the case of faulty processors.
Uploads
Papers