In this paper, we show how to establish correctness and time bounds (e.g., quality of service guarantees) for multi-agent systems composed of communicating rule-based agents. The f...
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
It is well known that our prior knowledge and experiences affect how we learn new concepts. Although several formal modeling attempts have been made to quantitatively describe the ...
In this paper, we introduce the notion of communication channel into a multiagent system. We formalize the system in term of logic with Belief modality, where each possible world i...
with existing analysis tools. Modular reasoning principles such as abstraction, compositional refinement, and assume-guarantee reasoning are well understood for architectural hiera...