On deriving test suites for nondeterministic finite state machines with time-outs. - Natalia Shabaldina; R. F. Galimullin (Program. Comput. Softw., 2012)

Coalition and Group Announcement Logic. - Rustam Galimullin; Natasha Alechina (TARK, 2017)

Model Checking for Coalition Announcement Logic. - Rustam Galimullin; Natasha Alechina; Hans van Ditmarsch (KI, 2018)

Groups Versus Coalitions: On the Relative Expressivity of GAL and CAL. - Tim French 002; Rustam Galimullin; Hans van Ditmarsch; Natasha Alechina (AAMAS, 2019)

Group Announcement Logic with Distributed Knowledge. - Rustam Galimullin; Thomas Ågotnes; Natasha Alechina (LORI, 2019)

Public Group Announcements and Trust in Doxastic Logic. - Elise Perrotin; Rustam Galimullin; Quentin Canu; Natasha Alechina (LORI, 2019)

Coalition announcements. - Rustam Galimullin (2019)

Quantified Announcements and Common Knowledge. - Rustam Galimullin; Thomas Ågotnes (AAMAS, 2021)

Dynamic Coalition Logic: Granting and Revoking Dictatorial Powers. - Rustam Galimullin; Thomas Ågotnes (LORI, 2021)

No Finite Model Property for Logics of Quantified Announcements. - Hans van Ditmarsch; Tim French 002; Rustam Galimullin (TARK, 2021)

Verification and Strategy Synthesis for Coalition Announcement Logic. - Natasha Alechina; Hans van Ditmarsch; Rustam Galimullin; Tuo Wang (J. Log. Lang. Inf., 2021)

Coalition and Relativised Group Announcement Logic. - Rustam Galimullin (J. Log. Lang. Inf., 2021)

Action Models for Coalition Logic. - Rustam Galimullin; Thomas Ågotnes (DaLí, 2022)

Coalition Logic for Specification and Verification of Smart Contract Upgrades. - Rustam Galimullin; Thomas Ågotnes (PRIMA, 2022)

Logic of Visibility in Social Networks. - Rustam Galimullin; Mina Young Pedersen; Marija Slavkovik 001 (WoLLIC, 2022)

Logics with Group Announcements and Distributed Knowledge: Completeness and Expressive Power. - Thomas Ågotnes; Natasha Alechina; Rustam Galimullin (J. Log. Lang. Inf., 2022)

(Arbitrary) Partial Communication. - Rustam Galimullin; Fernando R. Velázquez-Quesada (AAMAS, 2023)

Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ11-hard. - Rustam Galimullin; Louwe B. Kuijer (TARK, 2023)

Quantifying over information change with common knowledge. - Thomas Ågotnes; Rustam Galimullin (Auton. Agents Multi Agent Syst., 2023)

The Expressivity of Quantified Group Announcements. - Natasha Alechina; Hans van Ditmarsch; Tim French 002; Rustam Galimullin (J. Log. Comput., 2023)

Varieties of Distributed Knowledge. - Rustam Galimullin; Louwe B. Kuijer (AiML, 2024)

Dynamic Epistemic Logic of Resource Bounded Information Mining Agents. - Vitaliy Dolgorukov; Rustam Galimullin; Maksim Gladyshev (AAMAS, 2024)

Synthesizing Social Laws with ATL Conditions. - Rustam Galimullin; Louwe B. Kuijer (AAMAS, 2024)

Visibility and exploitation in social networks. - Rustam Galimullin; Mina Young Pedersen (Math. Struct. Comput. Sci., 2024)

Changing the Rules of the Game: Reasoning About Dynamic Phenomena in Multi-Agent Systems. - Rustam Galimullin; Maksim Gladyshev; Munyque Mittelmann; Nima Motamed (AAMAS, 2025)

Anonymous Public Announcements. - Thomas Ågotnes; Rustam Galimullin; Ken Satoh; Satoshi Tojo (CoRR, 2025)

First-Order Coalition Logic. - Davide Catta; Rustam Galimullin; Aniello Murano (CoRR, 2025)