Anatol Slissenko - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2020

On Entropic Convergence of AlgorithmsAnatol Slissenko. BIRTHDAY 2020: 291-304 [doi]

2017

Towards Analysis of Information Structure of ComputationsAnatol Slissenko. flap, 4(4), 2017. [doi]

2010

PrefaceSergei N. Artëmov, Yuri Matiyasevich, Grigori Mints, Anatol Slissenko. APAL, 162(3):173-174, 2010. [doi]

2008

Stability of Real-Time Abstract State Machines under DesynchronizationJoëlle Cohen, Anatol Slissenko. asmta 2008: 341 [doi]

Simulation of Timed Abstract State Machines with Predicate Logic Model-CheckingAnatol Slissenko, Pavel Vasilyev. jucs, 14(12):1984-2006, 2008.

2006

Periodicity based decidable classes in a first order timed logicDanièle Beauquier, Anatol Slissenko. APAL, 139(1-3):43-73, 2006. [doi]

A Logic of Probability with Decidable Model CheckingDanièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko. logcom, 16(4):461-487, 2006. [doi]

2005

IntroductionDanièle Beauquier, Egon Börger, Anatol Slissenko. asmta 2005: 5-10 [doi]

Verification in Predicate Logic with Time: Algorithmic QuestionsAnatol Slissenko. csl 2005: 3-17 [doi]

On Implementations of Instantaneous Actions Real-Time ASM by ASM with DelaysAnatol Slissenko, Joëlle Cohen. asmta 2005: 387-396 [doi]

Probability and Time in Measuring SecurityAnatol Slissenko. vissas 2006: 169-183

2004

Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilonDima Burago, Dima Grigoriev, Anatol Slissenko. TCS, 315(2-3):371-404, 2004. [doi]

A Logic Framework for Verification of Timed AlgorithmsAnatol Slissenko. FUIN, 62(1):29-67, 2004. [doi]

2003

Complexity Problems in the Analysis of Information Systems SecurityAnatol Slissenko. mmmacns 2003: 47-56 [doi]

2002

Decidable verification for reducible timed automata specified in a first order logic with timeDanièle Beauquier, Anatol Slissenko. TCS, 275(1-2):347-388, 2002. [doi]

A Logic of Probability with Decidable Model-CheckingDanièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko. csl 2002: 306-321 [doi]

The Probability Nesting GameDanièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich, Anatol Slissenko. ENTCS, 68(2):4-14, 2002. [doi]

2001

A first order logic for specification of timed algorithms: basic properties and a decidable classDanièle Beauquier, Anatol Slissenko. APAL, 113(1-3):13-52, 2001.

2000

On Verification of Refinements of Timed Distributed AlgorithmsJoëlle Cohen, Anatol Slissenko. asmta 2000: 34-49 [doi]

1999

Decidable Classes of the Verification Problem in a Timed Predicate LogicDanièle Beauquier, Anatol Slissenko. fct 1999: 100-111 [doi]

Complexity Problems in Analysis of Multi-Agent SystemsAnatol Slissenko. ceemas 1999:

1998

Polytime Model Checking for Timed Probabilistic Computation Tree LogicDanièle Beauquier, Anatol Slissenko. ACTA, 35(8):645-664, 1998. [doi]

Polytime Algorithm for the Shortest Path in a Homotopy Class Amidst Semi-Algebraic Obstacles in the PlaneDima Grigoriev, Anatol Slissenko. issac 1998: 17-24 [doi]

1997

The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level LanguagesDanièle Beauquier, Anatol Slissenko. tapsoft 1997: 201-212

Computing Minimum-Link Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the PlaneDima Grigoriev, Anatol Slissenko. AAECC 1997: 114-129

1996

On the Complexity of Partially Observed Markov Decision ProcessesDima Burago, Michel de Rougemont, Anatol Slissenko. TCS, 157(2):161-183, 1996. [doi]

1995

On the Complexity of Finite Memory Policies for Markov Decision ProcessesDanièle Beauquier, Dima Burago, Anatol Slissenko. mfcs 1995: 191-200

1993

On Fault Tolerance of SyntaxAnatol Slissenko. TCS, 119(1):215-222, 1993.

1991

On measures of information quality of knowledge processing systemsAnatol Slissenko. isci, 57-58:389-401, 1991. [doi]

Sign in or sign up to see more results.

runs on WebDSL