A Modal Logic for Network Topologies

Authors:
Rogier M. van Eijk;Frank S. de Boer;Wiebe van der Hoek;John-Jules Ch. Meyer
Affiliations:
-;-;-;-
Venue:
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Year:
2000

Citing 6
Cited 0

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
First-order modal logic

First-order modal logic
Epistemic Logic for AI and Computer Science

Epistemic Logic for AI and Computer Science
Propositional Temporal Logics and Equivalences

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
A Scalable Agent Location Mechanism

ATAL '99 6th International Workshop on Intelligent Agents VI, Agent Theories, Architectures, and Languages (ATAL),
Open Multi-agent Systems: Agent Communication and Integration

ATAL '99 6th International Workshop on Intelligent Agents VI, Agent Theories, Architectures, and Languages (ATAL),

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a logical framework that combines modality with a first-order quantification mechanism. The logic differs from standard first-order modal logics in that quantification is not performed inside the states of a model, but the states in the model themselves constitute the domain of quantification. The locality principle of modal logic is preserved via the requirement that in each state, the domain of quantification is restricted to a subset of the entire set of states in the model. We show that the language is semantically characterised by a generalisation of classical bisimulation, called history-based bisimulation, consider its decidability and study the application of the logic to describe and reason about the topologies of multi-agent systems.