Abstract
With the recent development of many model-checkers for the temporal logic of knowledge, abstraction techniques are necessary to increase the size of the systems that can be verified. In this paper, we introduce several abstraction techniques for interpreted systems and we prove several preservation results. These results consider the temporal logic of knowledge under Kleene's 3-valued interpretation along infinite and maximal finite paths. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Enea, C., & Dima, C. (2007). Abstractions of multi-agent systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4696 LNAI, pp. 11–21). Springer Verlag. https://doi.org/10.1007/978-3-540-75254-7_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
