RUS  ENG
Полная версия
ЖУРНАЛЫ // Моделирование и анализ информационных систем

Модел. и анализ информ. систем, 2013, том 20, номер 6, страницы 10–21 (Mi mais339)

Общие знания в хорошо структурированных системах с абсолютной памятью
Н. О. Гаранина

Список литературы

1. P. A. Abdulla, K. Ĉerâns, B. Jonsson, Yih-Kuen Tsay, “Algorithmic analysis of programs with well quasi-ordered domains”, Information and Computation, 160:1–2 (2000), 109–127  crossref  mathscinet  zmath  isi
2. R. H. Bordini, M. Fisher, W. Visser, M. Wooldridge, “Verifying Multi-agent Programs by Model Checking”, Autonomous Agents and Multi-Agent Systems, 12:2 (2006), 239–256  crossref  isi
3. M. Cohen, A. Lomuscio, “Non-elementary speed up for model checking synchronous perfect recall”, Proceeding of the 2010 conference on ECAI 2010, IOS Press, Amsterdam, 2010, 1077–1078
4. E. A. Emerson, “Temporal and Modal Logic”, Handbook of Theoretical Computer Science, v. B, Elsevier; MIT Press, 1990, 995–1072  mathscinet  zmath
5. R. Fagin, J. Y. Halpern, Y. Moses, M. Y. Vardi, Reasoning about Knowledge, MIT Press, 1995  mathscinet  zmath
6. A. Finkel, Ph. Schnoebelen, Well-structured transition systems everywhere!, Theor. Comp. Sci., 256:1–2 (2001), 63–92  crossref  mathscinet  zmath
7. N. O. Garanina, N. A. Kalinina, N. V. Shilov, “Model checking knowledge, actions and fixpoints”, Proc. of Concurrency, Specification and Programming Workshop CS&P'2004 (Germany, 2004), v. 2, Informatik-Bericht, 170, Humboldt Universitat, Berlin, 351–357
8. N. O. Garanina, “Exponential Improvement of Time Complexity of Model Checking for Multiagent Systems with Perfect Recall”, Programming and Computer Software, 38:6 (2012), 294–303  crossref  zmath  isi
9. J. Y. Halpern, R. van der Meyden, M. Y. Vardi, “Complete Axiomatizations for Reasoning About Knowledge and Time”, SIAM J. Comp., 33:3 (2004), 674–703  crossref  mathscinet  zmath
10. J. Y. Halpern, L. D. Zuck, “A little knowledge goes a long way: knowledge-based derivations and correctness proofs for a family of protocols”, Journal of the ACM, 39:3 (1992), 449–478  crossref  mathscinet  zmath  isi
11. X. Huang, R. van der Meyden, “The Complexity of Epistemic Model Checking: Clock Semantics and Branching Time”, Proc. of 19th ECAI (Lisbon, Portugal, August 16–20), Frontiers in Artificial Intelligence and Applications, 215, IOS Press, 2010, 549–554  zmath
12. E. V. Kouzmin, N. V. Shilov, V. A. Sokolov, “Model Checking $\mu$-Calculus in Well-Structured Transition Systems”, Proc. of 11th International Symposium on Temporal Representation and Reasoning, TIME'04, IEEE Press, France, 152–155
13. D. Kozen, “Results on the Propositional Mu-Calculus”, Theoretical Computer Science, 27:3 (1983), 333–354  crossref  mathscinet  zmath  isi
14. D. Kozen, J. Tiuryn, “Logics of Programs”, Handbook of Theoretical Computer Science, v. B, Elsevier and MIT Press, 1990, 789–840  mathscinet  zmath
15. M. Z. Kwiatkowska, A. Lomuscio, H. Qu, “Parallel Model Checking for Temporal Epistemic Logic”, Proc. of 19th ECAI (Lisbon, Portugal, August 16–20), Frontiers in Artificial Intelligence and Applications, 215, IOS Press, 2010, 543–548  zmath
16. A. Lomuscio, W. Penczek, H. Qu, “Partial order reductions for model checking temporal epistemic logics over interleaved multi-agent systems”, Proc. of 9th AAMAS (Toronto, Canada, May 10–14, 2010), v. 1, IFAAMAS, 2010, 659–666  mathscinet
17. R. van der Meyden, N. V. Shilov, “Model Checking Knowledge and Time in Systems with Perfect Recall”, Lect. Notes Comput. Sci., 1738, 1999, 432–445  zmath
18. N. V. Shilov, N. O. Garanina, K.-M. Choe, “Update and Abstraction in Model Checking of Knowledge and Branching Time”, Fundamenta Informaticae, 72:1–3 (2006), 347–361  mathscinet  zmath  isi
19. N. V. Shilov, N. O. Garanina, “Well-structured Model Checking of Multiagent Systems”, Proceedings of 6th International Conference on Perspectives of System Informatics (Novosibirsk, Russia, June 27–30, 2006), Lecture Notes in Computer Science, 4378, 2006


© МИАН, 2025