The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Anatol Slissenko: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  25. Stability of Real-Time Abstract State Machines under Desynchronization. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002