Automata for Epistemic Temporal Logic with Synchronous Communication

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...

Full description

Bibliographic Details
Published in:Journal of Logic, Language, and Information, Vol. 19, No. 4 (2010), p. 451-484
Main Author: Mohalik, Swamp
Other Involved Persons: Ramanujam, R.
Format: electronic Article
Language:English
ISSN:1572-9583
Item Description:Copyright: © 2010 Springer
Physical Description:Online-Ressource
Subjects:
Other Editions:Show all 2 Editions
QR Code: Show QR Code
LEADER 02126nma a2200301 c 4500
001 JST04960063X
003 DE-601
005 20180604203508.0
007 cr uuu---uuuuu
008 150324s2010 000 0 eng d
024 8 |a 40802003 
035 |a 40802003 
040 |b ger  |c GBVCP 
041 0 |a eng 
100 1 |a Mohalik, Swamp 
245 1 0 |a Automata for Epistemic Temporal Logic with Synchronous Communication  |h Elektronische Ressource 
300 |a Online-Ressource 
500 |a Copyright: © 2010 Springer 
520 |a 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. 
611 2 7 |a research-article  |2 gnd 
689 0 0 |A f  |a research-article 
689 0 |5 DE-601 
700 1 |a Ramanujam, R. 
773 0 8 |i in  |t Journal of Logic, Language, and Information  |g Vol. 19, No. 4 (2010), p. 451-484  |q 19:4<451-484  |w (DE-601)JST049598945  |x 1572-9583 
856 4 1 |u https://www.jstor.org/stable/40802003  |3 Volltext 
912 |a GBV_JSTOR 
951 |a AR 
952 |d 19  |j 2010  |e 4  |h 451-484