Distributed Computing
The logic of distributed protocols
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Handbook of theoretical computer science (vol. B)
Reasoning about knowledge
Local Knowledge Assertions in a Changing World
Proceedings of the Sixth Conference on Theoretical Aspects of Rationality and Knowledge
The logic of public announcements, common knowledge, and private suspicions
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
Deterministic Asynchronous Automata for Infinite Traces
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Distributed Processes and the Logic of Knowledge
Proceedings of the Conference on Logic of Programs
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Locally linear time temporal logic
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Knowledge Based Semantics of Messages
Journal of Logic, Language and Information
Complete Axiomatizations for Reasoning about Knowledge and Time
SIAM Journal on Computing
Knowledge and the ordering of events in distributed systems: extended abstract
TARK '94 Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge
Foundations of knowledge for distributed systems
TARK '86 Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge
Logics of communication and change
Information and Computation
Merging frameworks for interaction: DEL and ETL
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Dynamic Epistemic Logic
The logic of communication graphs
DALT'04 Proceedings of the Second international conference on Declarative Agent Languages and Technologies
| Hi-index | 0.00 |
We suggest that developing automata theoretic foundations is relevant for knowledge theory, so that we study not only what is known by agents, but also the mechanisms by which such knowledge is arrived at. We define a class of epistemic automata, in which agents' local states are annotated with abstract knowledge assertions about others. These are finite state agents who communicate synchronously with each other and information exchange is `perfect'. We show that the class of recognizable languages has good closure properties, leading to a Kleene-type theorem using what we call regular knowledge expressions. These automata model distributed causal knowledge in the following way: each agent in the system has a partial knowledge of the temporal evolution of the system, and every time agents synchronize, they update each other's knowledge, resulting in a more up-to-date view of the system state. Hence we show that these automata can be used to solve the satisfiability problem for a natural epistemic temporal logic for local properties. Finally, we characterize the class of languages recognized by epistemic automata as the regular consistent languages studied in concurrency theory.