| 2008 |
| 11 | EE | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Mars K. Valiev:
Temporal Verification of Probabilistic Multi-Agent Systems.
Pillars of Computer Science 2008: 256-265 |
| 2006 |
| 10 | EE | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Mars K. Valiev:
On complexity of verification of interacting agents' behavior.
Ann. Pure Appl. Logic 141(3): 336-362 (2006) |
| 2003 |
| 9 | EE | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Mars K. Valiev:
On feasible cases of checking multi-agent systems behavior.
Theor. Comput. Sci. 1(303): 63-81 (2003) |
| 2002 |
| 8 | EE | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Mars K. Valiev:
Complexity of Multi-agent Systems Behavior.
JELIA 2002: 125-136 |
| 1999 |
| 7 | EE | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Mars K. Valiev:
Applying Temporal Logic to Analysis of Behavior of Cooperating Logic Programs.
Ershov Memorial Conference 1999: 228-234 |
| 1993 |
| 6 | | Mars K. Valiev:
Product 1 over 1-Universality of Some Propositional Logics of Concurrent Programs.
Theor. Comput. Sci. 119(1): 223-232 (1993) |
| 1980 |
| 5 | | Mars K. Valiev:
On axiomatization of process logic.
Logic of Programs 1980: 304-313 |
| 4 | | Mars K. Valiev:
Decision Complexity of Variants of Propositional Dynamic Logic.
MFCS 1980: 656-664 |
| 1979 |
| 3 | | Mars K. Valiev:
On Axiomatization of Deterministic Propositional Dynamic Logic.
MFCS 1979: 482-491 |
| 1977 |
| 2 | | Mars K. Valiev:
Real Time Computations with Restrictions on Tape Alphabet.
MFCS 1977: 532-536 |
| 1975 |
| 1 | | Mars K. Valiev:
On Polynomial Reducibility of Word Problem Under Embedding of Recursively Presented Groups in Finitely Presented Groups.
MFCS 1975: 432-438 |