Results 1 
2 of
2
Parameterized Verification of Communicating Automata under Context Bounds
 In RP’14, LNCS 8762
, 2014
"... Abstract. We study the verification problem for parameterized communicating automata (PCA), in which processes synchronize via message passing. A given PCA can be run on any topology of bounded degree (such as pipelines, rings, or ranked trees), and communication may take place between any two proc ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We study the verification problem for parameterized communicating automata (PCA), in which processes synchronize via message passing. A given PCA can be run on any topology of bounded degree (such as pipelines, rings, or ranked trees), and communication may take place between any two processes that are adjacent in the topology. Parameterized verification asks if there is a topology from a given topology class that allows for an accepting run of the given PCA. In general, this problem is undecidable even for synchronous communication and simple pipeline topologies. We therefore consider contextbounded verification, which restricts the behavior of each single process. For several variants of context bounds, we show that parameterized verification over pipelines, rings, and ranked trees is decidable. More precisely, it is PSPACEcomplete for pipelines and rings, and EXPTIMEcomplete for ranked trees. Our approach is automatatheoretic. We build a finite (tree, respectively) automaton that identifies those topologies that allow for an accepting run of the given PCA. The verification problem then reduces to checking nonemptiness of that automaton. 1
Research internship (Master M2) Title Synthesis of Distributed Systems with Parameterized Network Topology Description
"... We consider distributed programs that can be run on an arbitrary network topology from a class of topologies (e.g., on all pipeline, all grid, or all ring topologies). Typically, such a program is given by a single sequential process, and a copy of that process can be run on any node in the given ne ..."
Abstract
 Add to MetaCart
We consider distributed programs that can be run on an arbitrary network topology from a class of topologies (e.g., on all pipeline, all grid, or all ring topologies). Typically, such a program is given by a single sequential process, and a copy of that process can be run on any node in the given network topology. During its execution, each process may receive signals from an (uncontrollable) environment. In parameterized synthesis, a specification ϕ is given (e.g., a temporallogic formula) describing the desired system behavior. The goal is then to synthesize a program that implements ϕ. Thus, the program acts as a collection of local controllers that enforce the system to satisfy ϕ, independently of the network topology and independently of the behavior of the environment. There have been, so far, only a few approaches to parameterized synthesis [1, 2]. Existing works consider specifications that are interpreted over sequentialized executions of a system. The aim of the internship is to develop a framework for parameterized synthesis in a setting with real concurrency, where the specification is interpreted over partially ordered behaviors reflecting the parallelism. This will combine [1, 2], [3], and [4], where parameterized synthesis, partialorder