Distributed Computing for Emerging Smart Networks
Second International Workshop, DiCES-N 2020, Bizerte, Tunisia, December 18, 2020, Proceedings
Page
%P
15 Result(s)
-
Book and Conference Proceedings
-
Chapter and Conference Paper
Traffic Congestion Detection: Solutions, Open Issues and Challenges
In recent years, cities are experiencing a deep negative impact due to traffic congestion. As the number of vehicles is increasing rapidly, traffic congestion becomes unsustainable in urban domains specially i...
-
Chapter and Conference Paper
Formal Proofs of Termination Detection for Local Computations by Refinement-Based Compositions
In this paper, we propose a formal framework enhancing the termination detection property of distributed algorithms and reusing their specifications as well as their proofs. By relying on refinement and compos...
-
Chapter and Conference Paper
Uncertainty Interval Temporal Sequences Extraction
Searching for frequent sequential patterns has been used in several domains. We note that times granularities are more or less important with regards to the application domain. In this paper we propose a frequ...
-
Chapter and Conference Paper
Refinement-Based Verification of Local Synchronization Algorithms
Synchronization algorithms are mandatory for simulating local computation models of distributed algorithms. Therefore, correctness of these algorithms becomes crucial, because it gives confidence that local co...
-
Book and Conference Proceedings
Principles of Distributed Systems
14th International Conference, OPODIS 2010, Tozeur, Tunisia, December 14-17, 2010. Proceedings
-
Chapter and Conference Paper
A Generic Distributed Algorithm for Computing by Random Mobile Agents
In this paper, we investigate the following problem: k mobile agents are placed in a network. The agents initially move in the network using random walks. They have unique identities and mark on the ...
-
Chapter and Conference Paper
A Distributed Computational Model for Mobile Agents
In this paper, a novel formalized mobile agent distributed computation model based on transition systems is presented. In our model, the mobile agent actions (e.g. computations, communication and migration) ar...
-
Chapter and Conference Paper
Workshop on Graph Computation Models
A variety of computation models have been developed using graphs and graph transformations. These include models for sequential, distributed, parallel or mobile computation. A graph may represent, in an abstra...
-
Chapter and Conference Paper
Mobile Agents Implementing Local Computations in Graphs
Mobile agents are a well-known paradigm for the design and implementation of distributed systems. However, whilst their popularity continues to grow, a uniform theory of mobile agent systems is not yet suffici...
-
Chapter and Conference Paper
Distributed Local 2-Connectivity Test of Graphs and Applications
The vertex connectivity of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. This work is devoted to the problem of vertex connectivity test of graphs in a dist...
-
Chapter and Conference Paper
Workshop on Graph Computation Models
A variety of computation models have been developed using graphs and graph transformations. These include models for sequential, distributed, parallel or mobile computation. A graph may represent, in an abstra...
-
Chapter and Conference Paper
A Local Self-stabilizing Enumeration Algorithm
We present a novel self-stabilizing version of Mazurkiewicz enumeration algorithm [1]. The initial version is based on local rules to enumerate nodes on an anonymous network. [2] presented the first self-stabi...
-
Chapter and Conference Paper
Synchronizers for Local Computations
A synchronizer is intended to allow synchronous algorithms to be executed on asynchronous networks. It is useful because designing synchronous algorithms is generally much easier than designing asynchronous on...
-
Chapter and Conference Paper
Termination Detection of Distributed Algorithms by Graph Relabelling Systems
A unified and general scheme for detecting the termination of distributed computations is proposed. This scheme uses the encoding of distributed algorithms in form of graph rewriting systems to transform the p...
