Anatol Slissenko

Publication Activity (10 Years)

Years Active: 1991-2022
Publications (10 Years): 4

Top Topics

Recently Developed

Information Sources

Theoretical Justification

Computational Efficiency

Top Venues

Fields of Logic and Computation III

Publications

Anatol Slissenko
Relating Information and Proof. CoRR (2022)
Anatol Slissenko
On Entropic Convergence of Algorithms. Fields of Logic and Computation III (2020)
Anatol Slissenko
Towards Analysis of Information Structure of Computations. FLAP 4 (4) (2017)
Anatol Slissenko
On entropic convergence of algorithms in terms of domain partitions. CoRR (2016)
Sergei N. Artëmov, Yuri V. Matiyasevich, Grigori Mints, Anatol Slissenko
Preface. Ann. Pure Appl. Log. 162 (3) (2010)
Joëlle Cohen, Anatol Slissenko
Stability of Real-Time Abstract State Machines under Desynchronization. ABZ (2008)
Anatol Slissenko, Pavel Vasilyev
Simulation of Timed Abstract State Machines with Predicate Logic Model-Checking. J. Univers. Comput. Sci. 14 (12) (2008)
Danièle Beauquier, Anatol Slissenko
Periodicity based decidable classes in a first order timed logic. Ann. Pure Appl. Log. 139 (1-3) (2006)
Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko
A Logic of Probability with Decidable Model Checking. J. Log. Comput. 16 (4) (2006)
Anatol Slissenko
Verification in Predicate Logic with Time: Algorithmic Questions. CSL (2005)
Anatol Slissenko, Joëlle Cohen
On Implementations of Instantaneous Actions Real-Time ASM by ASM with Delays. Abstract State Machines (2005)
Danièle Beauquier, Egon Börger, Anatol Slissenko
Introduction. Abstract State Machines (2005)
Anatol Slissenko
Probability and Time in Measuring Security. VISSAS (2005)
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) (2004)
Anatol Slissenko
A Logic Framework for Verification of Timed Algorithms. Fundam. Informaticae 62 (1) (2004)
Anatol Slissenko
Complexity Problems in the Analysis of Information Systems Security. MMM-ACNS (2003)
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) (2002)
Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko
A Logic of Probability with Decidable Model-Checking. CSL (2002)
Danièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich, Anatol Slissenko
The Probability Nesting Game. EXPRESS (2002)
Danièle Beauquier, Anatol Slissenko
A first order logic for specification of timed algorithms: basic properties and a decidable class. Ann. Pure Appl. Log. 113 (1-3) (2001)
Joëlle Cohen, Anatol Slissenko
On Verification of Refinements of Timed Distributed Algorithms. Abstract State Machines (2000)
Danièle Beauquier, Anatol Slissenko
Decidable Classes of the Verification Problem in a Timed Predicate Logic. FCT (1999)
Anatol Slissenko
Complexity Problems in Analysis of Multi-Agent Systems. CEEMAS (1999)
Danièle Beauquier, Anatol Slissenko
Polytime Model Checking for Timed Probabilistic Computation Tree Logic. Acta Informatica 35 (8) (1998)
Dima Grigoriev, Anatol Slissenko
Polytime Algorithm for the Shortest Path in a Homotopy Class Amidst Semi-Algebraic Obstacles in the Plane. ISSAC (1998)
Dima Grigoriev, Anatol Slissenko
Computing Minimum-Link Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the Plane. AAECC (1997)
Danièle Beauquier, Anatol Slissenko
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages. TAPSOFT (1997)
Dima Burago, Michel de Rougemont, Anatol Slissenko
On the Complexity of Partially Observed Markov Decision Processes. Theor. Comput. Sci. 157 (2) (1996)
Danièle Beauquier, Dima Burago, Anatol Slissenko
On the Complexity of Finite Memory Policies for Markov Decision Processes. MFCS (1995)
Anatol Slissenko
On Fault Tolerance of Syntax. Theor. Comput. Sci. 119 (1) (1993)
Anatol Slissenko
On measures of information quality of knowledge processing systems. Inf. Sci. (1991)