Distributed automata in an assumption-commitment framework

We propose a class of finite state systems of synchronizing distributed processes, where processes make assumptions at local states about the state of other processes in the system. This constrains the global states of the system to those where assumptions made by a process about another are compati...

Full description

Bibliographic Details
Published in:Sādhanā : Published by the Indian Academy of Sciences, Vol. 27, No. 2 (2002), p. 209-250
Main Author: Mohalik, Swarup
Other Involved Persons: Ramanujam, R.
Format: electronic Article
Language:English
ISSN:0973-7677
Item Description:The main results here were first reported in an earlier paper (Mohalik & Ramanujam 1998). We thank the anonymous reviewers for detailed comments that helped to improve the presentation
Physical Description:Online-Ressource
DOI:10.1007/BF02717184
Subjects:
QR Code: Show QR Code
LEADER 02374nma a2200445 c 4500
001 SPR042818206
003 DE-601
005 20150323215006.0
007 cr uuu---uuuuu
008 150314s2002 000 0 eng d
024 7 |a 10.1007/BF02717184  |2 doi 
024 8 |a BF02717184 
035 |a BF02717184 
040 |b ger  |c GBVCP 
041 0 |a eng 
100 1 |a Mohalik, Swarup 
245 1 0 |a Distributed automata in an assumption-commitment framework  |h Elektronische Ressource 
300 |a Online-Ressource 
500 |a The main results here were first reported in an earlier paper (Mohalik & Ramanujam 1998). We thank the anonymous reviewers for detailed comments that helped to improve the presentation 
520 |a We propose a class of finite state systems of synchronizing distributed processes, where processes make assumptions at local states about the state of other processes in the system. This constrains the global states of the system to those where assumptions made by a process about another are compatible with the commitments offered by the other at that state. We model examples like reliable bit transmission and sequence transmission protocols in this framework and discuss how assumption-commitment structure facilitates compositional design of such protocols. We prove a decomposition theorem which states that every protocol specified globally as a finite state system can be decomposed into such an assumption compatible system. We also present a syntactic characterization of this class using top level parallel composition. 
611 2 7 |a OriginalPaper  |2 gnd 
650 7 |a Assumption-commitment  |2 gnd 
650 7 |a automata theory  |2 gnd 
650 7 |a concurrency theory  |2 gnd 
650 7 |a verification  |2 gnd 
650 7 |a decomposition  |2 gnd 
689 0 0 |A f  |a OriginalPaper 
689 0 |5 DE-601 
689 1 0 |A s  |a Assumption-commitment 
689 1 1 |A s  |a automata theory 
689 1 2 |A s  |a concurrency theory 
689 1 3 |A s  |a verification 
689 1 4 |A s  |a decomposition 
689 1 |5 DE-601 
700 1 |a Ramanujam, R. 
773 0 8 |i in  |t Sādhanā : Published by the Indian Academy of Sciences  |d Bangalore : Acad  |g Vol. 27, No. 2 (2002), p. 209-250  |q 27:2<209-250  |w (DE-601)SPR042810043  |x 0973-7677 
856 4 1 |u http://dx.doi.org/10.1007/BF02717184  |3 Volltext 
912 |a GBV_SPRINGER 
951 |a AR 
952 |d 27  |j 2002  |e 2  |c 04  |h 209-250