Results 1  10
of
11
Analysis of communicating automata
 In LATA 2010
, 2010
"... Abstract. This extended abstract is a survey of some of the recent developments in the area of automated verification dedicated to the analysis of communicating automata. Communicating automata are a fundamental computational model for concurrent systems, where processes cooperate via asynchronous ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
(Show Context)
Abstract. This extended abstract is a survey of some of the recent developments in the area of automated verification dedicated to the analysis of communicating automata. Communicating automata are a fundamental computational model for concurrent systems, where processes cooperate via asynchronous message passing using unbounded channels. They are a popular model for representing and reasoning about communication protocols, and they have been used to define the semantics of standardized specification languages such as SDL. However, from the algorithmic point of view communicating automata are more challenging than other true concurrent models such as Petri nets: indeed, this model is Turing equivalent, in particular it subsumes Post tag systems [20]. Therefore, basic questions arising in formal verification, such as the reachability problem, are intractable. Solving the reachability problem is actually the first step in tackling the more general modelchecking problem, that consists in verifying that the model, i.e. the
Cutting Through Regular Post Embedding Problems ⋆
"... Abstract. The Regular Post Embedding Problem extended with partial (co)directness is shown decidable. This extends to universal and/or counting versions. It is also shown that combining directness and codirectness in Post Embedding problems leads to undecidability. 1 ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. The Regular Post Embedding Problem extended with partial (co)directness is shown decidable. This extends to universal and/or counting versions. It is also shown that combining directness and codirectness in Post Embedding problems leads to undecidability. 1
The Parametric OrdinalRecursive Complexity of Post Embedding Problems
, 2012
"... Post Embedding Problems are a family of decision problems based on the interaction of a rational relation with the subword embedding ordering, and are used in the literature to prove non multiplyrecursive complexity lower bounds. We refine the construction of Chambart and Schnoebelen (LICS 2008) an ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Post Embedding Problems are a family of decision problems based on the interaction of a rational relation with the subword embedding ordering, and are used in the literature to prove non multiplyrecursive complexity lower bounds. We refine the construction of Chambart and Schnoebelen (LICS 2008) and prove parametric lower bounds depending on the size of the alphabet.
Reasoning about distributed systems: WYSIWYG (invited talk
 In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’14), Leibniz International Proceedings in Informatics. LeibnizZentrum für Informatik
, 2014
"... There are two schools of thought on reasoning about distributed systems: one following interleaving based semantics, and one following partialorder/graph based semantics. This paper compares these two approaches and argues in favour of the latter. An introductory treatment of the splitwidth techn ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
There are two schools of thought on reasoning about distributed systems: one following interleaving based semantics, and one following partialorder/graph based semantics. This paper compares these two approaches and argues in favour of the latter. An introductory treatment of the splitwidth technique is also provided. 1
The Impact of Communication Models on RoutingAlgorithm Convergence
"... Autonomous routing algorithms, such as BGP, are intended to reach a globally consistent set of routes after nodes iteratively and independently collect, process, and share network information. Generally, the important role of the mechanism used to share information has been overlooked in previous an ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Autonomous routing algorithms, such as BGP, are intended to reach a globally consistent set of routes after nodes iteratively and independently collect, process, and share network information. Generally, the important role of the mechanism used to share information has been overlooked in previous analyses of these algorithms. In this paper, we explicitly study how the networkcommunication model affects algorithm convergence. To do this, we consider a variety of factors, including channel reliability, how much information is processed from channels, and how many channels are processed simultaneously. Using these factors, we define a taxonomy of communication models and identify particular models of interest, including those used in previous theoretical work, those that most closely model realworld implementations of BGP, and those of potential interest for the design of future routing algorithms. We characterize an extensive set of relationships among models in our taxonomy and show that convergence depends on the communication model in nontrivial ways. These results highlight that certain models are best for proving conditions that guarantee convergence, while other models are best for characterizing conditions that might permit nonconvergence. 1.
Safety Verification of Communicating OneCounter Machines
"... In order to verify protocols that tag messages with integer values, we investigate the decidability of the reachability problem for systems of communicating onecounter machines. These systems consist of local onecounter machines that asynchronously communicate by exchanging the value of their coun ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
In order to verify protocols that tag messages with integer values, we investigate the decidability of the reachability problem for systems of communicating onecounter machines. These systems consist of local onecounter machines that asynchronously communicate by exchanging the value of their counters via, a priori unbounded, Fifo channels. This model extends communicating finitestate machines (Cfsm) by infinitestate local processes and an infinite message alphabet. The main result of the paper is a complete characterization of the communication topologies that have a solvable reachability question. As already Cfsm exclude the possibility of automatic verification in presence of mutual communication, we also consider an underapproximative approach to the reachability problem, based on rendezvous synchronization.
Rutgers University
, 2008
"... We model the task of interdomain routing—the task of connecting the networks that compose the Internet—as an iterative, highly distributed, asynchronous game. Unlike previous examinations of this game that assumed quasilinear utilities, we assume that each node has a quasibilinear utility dependin ..."
Abstract
 Add to MetaCart
(Show Context)
We model the task of interdomain routing—the task of connecting the networks that compose the Internet—as an iterative, highly distributed, asynchronous game. Unlike previous examinations of this game that assumed quasilinear utilities, we assume that each node has a quasibilinear utility depending not only on the route it believes it is assigned in the outcome, but also on other nodes assigned to route through it. This more realistic model captures outofband business relationships that may affect nodes ’ behavior in the game and the difficulty of monitoring traffic flows on the Internet. We show by example that conditions that guarantee incentive compatibility when utility does not depend on signaling do not provide this assurance in the model we study. We also extend the Stable Paths Problem to decouple forwarding from signaling and show that this allows stable signaling solutions to have forwarding loops, and we give a sufficient condition to prevent this. Finally, we provide
The Parametric OrdinalRecursive Complexity of Post Embedding Problems∗
"... Post Embedding Problems are a family of decision problems based on the interaction of a rational relation with the subword embedding ordering, and are used in the literature to prove non multiplyrecursive complexity lower bounds. We refine the construction of Chambart and Schnoebelen (LICS 2008) a ..."
Abstract
 Add to MetaCart
Post Embedding Problems are a family of decision problems based on the interaction of a rational relation with the subword embedding ordering, and are used in the literature to prove non multiplyrecursive complexity lower bounds. We refine the construction of Chambart and Schnoebelen (LICS 2008) and prove parametric lower bounds depending on the size of the alphabet. 1