Mars K. Valiev

15 papers B 5Journal 6Unranked 4
YearRankTypeTitle / Venue / Authors
2013 — conf
Complexity of Verification of Fuzzy Multi-Agent Systems.
MICAI (1)
Michael I. Dekhtyar, Mars K. Valiev
2011 J jnl
Complexity of verification of nondeterministic probabilistic multiagent systems.
Autom. Control. Comput. Sci.
Mars K. Valiev, Michael I. Dekhtyar
2009 J jnl
Systems of agents controlled by logical programs: Complexity of verification.
Program. Comput. Softw.
Mars K. Valiev, Michael I. Dekhtyar, Alexander Ja. Dikovsky
2008 — conf
Temporal Verification of Probabilistic Multi-Agent Systems.
Pillars of Computer Science
Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars K. Valiev
2006 J jnl
On complexity of verification of interacting agents' behavior.
Ann. Pure Appl. Log.
Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars K. Valiev
2003 J jnl
On feasible cases of checking multi-agent systems behavior.
Theor. Comput. Sci.
Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars K. Valiev
2002 B conf
Complexity of Multi-agent Systems Behavior.
JELIA
Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars K. Valiev
1999 — conf
Applying Temporal Logic to Analysis of Behavior of Cooperating Logic Programs.
Ershov Memorial Conference
Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars K. Valiev
1993 J jnl
Product 1 over 1-Universality of Some Propositional Logics of Concurrent Programs.
Theor. Comput. Sci.
Mars K. Valiev
1980 B conf
Decision Complexity of Variants of Propositional Dynamic Logic.
MFCS
Mars K. Valiev
1980 — conf
On axiomatization of process logic.
Logic of Programs
Mars K. Valiev
1979 B conf
On Axiomatization of Deterministic Propositional Dynamic Logic.
MFCS
Mars K. Valiev
1977 B conf
Real Time Computations with Restrictions on Tape Alphabet.
MFCS
Mars K. Valiev
1977 J jnl
Universal group with twenty-one defining relations.
Discret. Math.
Mars K. Valiev
1975 B conf
On Polynomial Reducibility of Word Problem Under Embedding of Recursively Presented Groups in Finitely Presented Groups.
MFCS
Mars K. Valiev