Anatol Slissenko

According to our database1, Anatol Slissenko
  • authored at least 28 papers between 1991 and 2016.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
On entropic convergence of algorithms in terms of domain partitions.
CoRR, 2016

2010
Preface.
Ann. Pure Appl. Logic, 2010

2008
Simulation of Timed Abstract State Machines with Predicate Logic Model-Checking.
J. UCS, 2008

Stability of Real-Time Abstract State Machines under Desynchronization.
Proceedings of the Abstract State Machines, B and Z, First International Conference, 2008

2006
A Logic of Probability with Decidable Model Checking.
J. Log. Comput., 2006

Periodicity based decidable classes in a first order timed logic.
Ann. Pure Appl. Logic, 2006

2005
Probability and Time in Measuring Security.
Proceedings of the Verification of Infinite-State Systems with Applications to Security, 2005

Verification in Predicate Logic with Time: Algorithmic Questions.
Proceedings of the Computer Science Logic, 19th International Workshop, 2005

On Implementations of Instantaneous Actions Real-Time ASM by ASM with Delays.
Proceedings of the 12th International Workshop on Abstract State Machines, 2005

Introduction.
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.
Theor. Comput. Sci., 2004

A Logic Framework for Verification of Timed Algorithms.
Fundam. Inform., 2004

2003
Complexity Problems in the Analysis of Information Systems Security.
Proceedings of the Computer Network Security, 2003

2002
Decidable verification for reducible timed automata specified in a first order logic with time.
Theor. Comput. Sci., 2002

The Probability Nesting Game.
Electr. Notes Theor. Comput. Sci., 2002

A Logic of Probability with Decidable Model-Checking.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001
A first order logic for specification of timed algorithms: basic properties and a decidable class.
Ann. Pure Appl. Logic, 2001

2000
On Verification of Refinements of Timed Distributed Algorithms.
Proceedings of the Abstract State Machines, 2000

1999
Decidable Classes of the Verification Problem in a Timed Predicate Logic.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Complexity Problems in Analysis of Multi-Agent Systems.
CEEMAS, 1999

1998
Polytime Model Checking for Timed Probabilistic Computation Tree Logic.
Acta Inf., 1998

Polytime Algorithm for the Shortest Path in a Homotopy Class Amidst Semi-Algebraic Obstacles in the Plane.
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.
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.
Proceedings of the Applied Algebra, 1997

1996
On the Complexity of Partially Observed Markov Decision Processes.
Theor. Comput. Sci., 1996

1995
On the Complexity of Finite Memory Policies for Markov Decision Processes.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1993
On Fault Tolerance of Syntax.
Theor. Comput. Sci., 1993

1991
On measures of information quality of knowledge processing systems.
Inf. Sci., 1991


  Loading...