DSpace
 

DSpace at IIT Bombay >
IITB Publications >
Proceedings papers >

Please use this identifier to cite or link to this item: http://dspace.library.iitb.ac.in/jspui/handle/100/1887

Title: Robust asynchronous protocols are finite-state
Authors: MUKUND, M
KUMAR, KN
RADHAKRISHNAN, J
SOHONI, M
Keywords: regular languages
systems
Issue Date: 1998
Publisher: SPRINGER-VERLAG BERLIN
Citation: AUTOMATA, LANGUAGES AND PROGRAMMING,1443,188-199
Abstract: We consider networks of finite-state machines which communicate over reliable channels which may reorder messages. Each machine in the network also has a local input tape. Since channels are unbounded, the network as a whole is, in general, infinite-state. An asynchronous protocol is a network equipped with an acceptance condition. Such a protocol is said to be robust if it never deadlocks and, moreover, it either accepts or rejects each input in an unambiguous manner. The behaviour of a. robust protocol is insensitive to nondeterminism introduced by either message reordering or the relative speeds at which components read their local inputs. Using an automata-theoretic model, we show that, at a global level, every robust asynchronous protocol has a finite-state representation To prove this, we establish a variety of pumping lemmas. We also demonstrate a distributed language which does not admit a robust protocol.
URI: http://dspace.library.iitb.ac.in/xmlui/handle/10054/15132
http://hdl.handle.net/100/1887
ISBN: 3-540-64781-3
ISSN: 0302-9743
Appears in Collections:Proceedings papers

Files in This Item:

There are no files associated with this item.

View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback