Anatol Slissenko

According to our database, Anatol Slissenko authored at least 30 papers between 1991 and 2022.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2022

Relating Information and Proof.

Anatol Slissenko

CoRR, 2022

2020

On Entropic Convergence of Algorithms.

Anatol Slissenko

Proceedings of the Fields of Logic and Computation III, 2020

2017

Towards Analysis of Information Structure of Computations.

Anatol Slissenko

FLAP, 2017

2016

On entropic convergence of algorithms in terms of domain partitions.

Anatol Slissenko

CoRR, 2016

2010

Preface.

Sergei N. Artëmov, Yuri V. Matiyasevich, Grigori Mints, Anatol Slissenko

Ann. Pure Appl. Log., 2010

2008

Simulation of Timed Abstract State Machines with Predicate Logic Model-Checking.

Anatol Slissenko, Pavel Vasilyev

J. Univers. Comput. Sci., 2008

Stability of Real-Time Abstract State Machines under Desynchronization.

Joëlle Cohen, Anatol Slissenko

Proceedings of the Abstract State Machines, B and Z, First International Conference, 2008

2006

A Logic of Probability with Decidable Model Checking.

Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko

J. Log. Comput., 2006

Periodicity based decidable classes in a first order timed logic.

Danièle Beauquier, Anatol Slissenko

Ann. Pure Appl. Log., 2006

2005

Probability and Time in Measuring Security.

Anatol Slissenko

Proceedings of the Verification of Infinite-State Systems with Applications to Security, 2005

Verification in Predicate Logic with Time: Algorithmic Questions.

Anatol Slissenko

Proceedings of the Computer Science Logic, 19th International Workshop, 2005

On Implementations of Instantaneous Actions Real-Time ASM by ASM with Delays.

Anatol Slissenko, Joëlle Cohen

Proceedings of the 12th International Workshop on Abstract State Machines, 2005

Introduction.

Danièle Beauquier, Egon Börger, Anatol Slissenko

Proceedings of the 12th International Workshop on Abstract State Machines, 2005

2004

Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon.

Dima Burago, Dima Grigoriev, Anatol Slissenko

Theor. Comput. Sci., 2004

A Logic Framework for Verification of Timed Algorithms.

Anatol Slissenko

Fundam. Informaticae, 2004

2003

Complexity Problems in the Analysis of Information Systems Security.

Anatol Slissenko

Proceedings of the Computer Network Security, 2003

2002

Decidable verification for reducible timed automata specified in a first order logic with time.

Danièle Beauquier, Anatol Slissenko

Theor. Comput. Sci., 2002

The Probability Nesting Game.

Danièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich, Anatol Slissenko

Proceedings of the 9th International Workshop on Expressiveness in Concurrency, 2002

2001

A first order logic for specification of timed algorithms: basic properties and a decidable class.

Danièle Beauquier, Anatol Slissenko

Ann. Pure Appl. Log., 2001

2000

On Verification of Refinements of Timed Distributed Algorithms.

Joëlle Cohen, Anatol Slissenko

Proceedings of the Abstract State Machines, 2000

1999

Decidable Classes of the Verification Problem in a Timed Predicate Logic.

Danièle Beauquier, Anatol Slissenko

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Complexity Problems in Analysis of Multi-Agent Systems.

Anatol Slissenko

Proceedings of the 1st International Workshop of Central and Eastern Europe on Multi-Agent Systems, 1999

1998

Polytime Model Checking for Timed Probabilistic Computation Tree Logic.

Danièle Beauquier, Anatol Slissenko

Acta Informatica, 1998

Polytime Algorithm for the Shortest Path in a Homotopy Class Amidst Semi-Algebraic Obstacles in the Plane.

Dima Grigoriev, Anatol Slissenko

Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998

1997

The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages.

Danièle Beauquier, Anatol Slissenko

Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

Computing Minimum-Link Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the Plane.

Dima Grigoriev, Anatol Slissenko

Proceedings of the Applied Algebra, 1997

1996

On the Complexity of Partially Observed Markov Decision Processes.

Dima Burago, Michel de Rougemont, Anatol Slissenko

Theor. Comput. Sci., 1996

1995

On the Complexity of Finite Memory Policies for Markov Decision Processes.

Danièle Beauquier, Dima Burago, Anatol Slissenko

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1993

On Fault Tolerance of Syntax.

Anatol Slissenko

Theor. Comput. Sci., 1993

1991

On measures of information quality of knowledge processing systems.

Anatol Slissenko

Inf. Sci., 1991