Computing with Mobile Agents in Distributed Networks

Kranakis, Evangelos; Kriz̧anc, Danny; Rajsbaum, Sergio

doi:10.1201/9781420011296.ch8

Cited by 4 publications

(5 citation statements)

References 27 publications

(40 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The direction-labels on the edges (also called a local orientation) represent network port numbers[14,27]. All of our results also hold for the case that each edge has a single direction-label that combines send and receive directions, e.g., "clockwise".…”

mentioning

confidence: 73%

“…Many concurrent systems consist of identical processes running in parallel, such as peer-to-peer systems, sensor networks, multi-agent systems, etc. [14,27,29]. Model checking is a successful technique for establishing correctness of such systems: model a system as the product transition system P G , where P is a transition system representing the process, and G is a network-graph describing the communication lines [9].…”

Section: Introductionmentioning

confidence: 99%

“…We further allow the edges of the network-graph to carry directions, called local port-numberings, along which the processes may send and receive tokens. Such network-graphs are typical in the distributed computing literature, for instance in mobile finite-state agents, e.g., [14,27,26]. Note that even slightly more powerful communication primitives such as pairwise-rendezvous have undecidable PMC for expressive logics such as prenex indexed CTL * \X [3].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Model Checking Parameterised Multi-token Systems via the Composition Method

Aminof

Rubin

2016

Automated Reasoning

View full text Add to dashboard Cite

We study the model checking problem of parameterised systems with an arbitrary number of processes, on arbitrary network-graphs, communicating using multiple multi-valued tokens, and specifications from indexed-branching temporal logic. We prove a composition theorem, in the spirit of Feferman-Vaught (1959) and Shelah (1979), and a finiteness theorem, and use these to decide the model checking problem. Our results assume two constraints on the process templates, one of which is the standard fairness assumption introduced in the cornerstone paper of Emerson and Namjoshi (1995). We prove that lifting any of these constraints results in undecidability. The importance of our work is three-fold: i) it demonstrates that the composition method can be fruitfully applied to model checking complex parameterised systems; ii) it identifies the most powerful model, to date, of parameterised systems for which model checking indexed branching-time specifications is decidable; iii) it tightly marks the borders of decidability of this model.

show abstract

mentioning

confidence: 73%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Model Checking Parameterised Multi-token Systems via the Composition Method

Aminof

Rubin

2016

Automated Reasoning

View full text Add to dashboard Cite

show abstract

“…Robots should achieve some task in their environment. We give some examples of foundational robot tasks [25]: A robot ensemble deploys or reconfigures if they move, in a collision-free way, to a certain target configuration. A robot ensemble gathers if, no matter where each robot starts, there is a vertex z, such that eventually every robot is in z.…”

Section: Orderings a (Finite) K-ordering Is A String α ∈ [K]mentioning

confidence: 99%

“…Foundational tasks include, for example, rendezvous (gather all robots in a single position) and reconfiguration (move to a new configuration in a collision-free way) [25,14,15]. This paper studies robots in partially known environments, i.e., robots do not have global information about the environment, but may know some (often topological) information (e.g., whether the environment is connected, or that it is a ring of some unknown size) [14].…”

Section: Introductionmentioning

confidence: 99%

Verification of Asynchronous Mobile-Robots in Partially-Known Environments

Aminof

Murano

Rubin

et al. 2015

PRIMA 2015: Principles and Practice of Multi-Agent Systems

View full text Add to dashboard Cite

Abstract. This paper establishes a framework based on logic and automata theory in which to model and automatically verify that multiple mobile robots, with sensing abilities, moving asynchronously, correctly perform their tasks. The motivation is from practical scenarios in which the environment is not completely know to the robots, e.g., physical robots exploring a maze, or software agents exploring a hostile network. The framework shows how to express tasks in a logical language, and exhibits an algorithm solving the parameterised verification problem, where the graphs are treated as the parameter. The main assumption that yields decidability is that the robots take a bounded number of turns. We prove that dropping this assumption results in undecidability, even for robots with very limited ("local") sensing abilities.

show abstract