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...
|Veröffentlicht in:||Sādhanā : Published by the Indian Academy of Sciences, Vol. 27, No. 2 (2002), p. 209-250|
|Weitere beteiligte Personen:|
|Anmerkung:||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|