On Polynomial Reducibility of Word Problem Under Embedding of Recursively Presented Groups in Finitely Presented Groups. - Mars K. Valiev (MFCS, 1975)

Real Time Computations with Restrictions on Tape Alphabet. - Mars K. Valiev (MFCS, 1977)

Universal group with twenty-one defining relations. - Mars K. Valiev (Discret. Math., 1977)

On Axiomatization of Deterministic Propositional Dynamic Logic. - Mars K. Valiev (MFCS, 1979)

On axiomatization of process logic. - Mars K. Valiev (Logic of Programs, 1980)

Decision Complexity of Variants of Propositional Dynamic Logic. - Mars K. Valiev (MFCS, 1980)

Product 1 over 1-Universality of Some Propositional Logics of Concurrent Programs. - Mars K. Valiev (Theor. Comput. Sci., 1993)

Applying Temporal Logic to Analysis of Behavior of Cooperating Logic Programs. - Michael I. Dekhtyar; Alexander Ja. Dikovsky; Mars K. Valiev (Ershov Memorial Conference, 1999)

Complexity of Multi-agent Systems Behavior. - Michael I. Dekhtyar; Alexander Ja. Dikovsky; Mars K. Valiev (JELIA, 2002)

On feasible cases of checking multi-agent systems behavior. - Michael I. Dekhtyar; Alexander Ja. Dikovsky; Mars K. Valiev (Theor. Comput. Sci., 2003)

On complexity of verification of interacting agents' behavior. - Michael I. Dekhtyar; Alexander Ja. Dikovsky; Mars K. Valiev (Ann. Pure Appl. Log., 2006)

Temporal Verification of Probabilistic Multi-Agent Systems. - Michael I. Dekhtyar; Alexander Ja. Dikovsky; Mars K. Valiev (Pillars of Computer Science, 2008)

Systems of agents controlled by logical programs: Complexity of verification. - Mars K. Valiev; Michael I. Dekhtyar; Alexander Ja. Dikovsky (Program. Comput. Softw., 2009)

Complexity of verification of nondeterministic probabilistic multiagent systems. - Mars K. Valiev; Michael I. Dekhtyar (Autom. Control. Comput. Sci., 2011)

Complexity of Verification of Fuzzy Multi-Agent Systems. - Michael I. Dekhtyar; Mars K. Valiev (MICAI (1), 2013)