| 2008 |
|---|
| 27 | | Edward A. Hirsch,
Alexander A. Razborov,
Alexei L. Semenov,
Anatol Slissenko:
Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings
Springer 2008 |
| 26 | EE | Joëlle Cohen,
Anatol Slissenko:
Stability of Real-Time Abstract State Machines under Desynchronization.
ABZ 2008: 341 |
| 25 | | Anatol Slissenko,
Pavel Vasilyev:
Simulation of Timed Abstract State Machines with Predicate Logic Model-Checking.
J. UCS 14(12): 1984-2006 (2008) |
| 2006 |
|---|
| 24 | EE | Danièle Beauquier,
Anatol Slissenko:
Periodicity based decidable classes in a first order timed logic.
Ann. Pure Appl. Logic 139(1-3): 43-73 (2006) |
| 23 | EE | Danièle Beauquier,
Alexander Moshe Rabinovich,
Anatol Slissenko:
A Logic of Probability with Decidable Model Checking.
J. Log. Comput. 16(4): 461-487 (2006) |
| 2005 |
|---|
| 22 | EE | Anatol Slissenko,
Joëlle Cohen:
On Implementations of Instantaneous Actions Real-Time ASM by ASM with Delays.
Abstract State Machines 2005: 387-396 |
| 21 | EE | Danièle Beauquier,
Egon Börger,
Anatol Slissenko:
Introduction.
Abstract State Machines 2005: 5-10 |
| 20 | EE | Anatol Slissenko:
Verification in Predicate Logic with Time: Algorithmic Questions.
CSL 2005: 3-17 |
| 19 | | Anatol Slissenko:
Probability and Time in Measuring Security.
VISSAS 2005: 169-183 |
| 2004 |
|---|
| 18 | EE | Anatol Slissenko:
A Logic Framework for Verification of Timed Algorithms.
Fundam. Inform. 62(1): 29-67 (2004) |
| 17 | EE | Dima Burago,
Dima Grigoriev,
Anatol Slissenko:
Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon.
Theor. Comput. Sci. 315(2-3): 371-404 (2004) |
| 2003 |
|---|
| 16 | EE | Anatol Slissenko:
Complexity Problems in the Analysis of Information Systems Security.
MMM-ACNS 2003: 47-56 |
| 2002 |
|---|
| 15 | EE | Danièle Beauquier,
Alexander Moshe Rabinovich,
Anatol Slissenko:
A Logic of Probability with Decidable Model-Checking.
CSL 2002: 306-321 |
| 14 | EE | Danièle Beauquier,
Yoram Hirshfeld,
Alexander Moshe Rabinovich,
Anatol Slissenko:
The Probability Nesting Game.
Electr. Notes Theor. Comput. Sci. 68(2): (2002) |
| 13 | EE | Danièle Beauquier,
Anatol Slissenko:
Decidable verification for reducible timed automata specified in a first order logic with time.
Theor. Comput. Sci. 275(1-2): 347-388 (2002) |
| 2001 |
|---|
| 12 | | Danièle Beauquier,
Anatol Slissenko:
A first order logic for specification of timed algorithms: basic properties and a decidable class.
Ann. Pure Appl. Logic 113(1-3): 13-52 (2001) |
| 2000 |
|---|
| 11 | EE | Joëlle Cohen,
Anatol Slissenko:
On Verification of Refinements of Timed Distributed Algorithms.
Abstract State Machines 2000: 34-49 |
| 1999 |
|---|
| 10 | | Anatol Slissenko:
Complexity Problems in Analysis of Multi-Agent Systems.
CEEMAS 1999 |
| 9 | EE | Danièle Beauquier,
Anatol Slissenko:
Decidable Classes of the Verification Problem in a Timed Predicate Logic.
FCT 1999: 100-111 |
| 1998 |
|---|
| 8 | EE | Dima Grigoriev,
Anatol Slissenko:
Polytime Algorithm for the Shortest Path in a Homotopy Class Amidst Semi-Algebraic Obstacles in the Plane.
ISSAC 1998: 17-24 |
| 7 | EE | Danièle Beauquier,
Anatol Slissenko:
Polytime Model Checking for Timed Probabilistic Computation Tree Logic.
Acta Inf. 35(8): 645-664 (1998) |
| 1997 |
|---|
| 6 | | Dima Grigoriev,
Anatol Slissenko:
Computing Minimum-Link Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the Plane.
AAECC 1997: 114-129 |
| 5 | | Danièle Beauquier,
Anatol Slissenko:
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages.
TAPSOFT 1997: 201-212 |
| 1996 |
|---|
| 4 | EE | Dima Burago,
Michel de Rougemont,
Anatol Slissenko:
On the Complexity of Partially Observed Markov Decision Processes.
Theor. Comput. Sci. 157(2): 161-183 (1996) |
| 1995 |
|---|
| 3 | | Danièle Beauquier,
Dima Burago,
Anatol Slissenko:
On the Complexity of Finite Memory Policies for Markov Decision Processes.
MFCS 1995: 191-200 |
| 1993 |
|---|
| 2 | | Anatol Slissenko:
On Fault Tolerance of Syntax.
Theor. Comput. Sci. 119(1): 215-222 (1993) |
| 1991 |
|---|
| 1 | EE | Anatol Slissenko:
On measures of information quality of knowledge processing systems.
Inf. Sci. 57-58: 389-401 (1991) |
