×

zbMATH — the first resource for mathematics

Slissenko, Anatol

Compute Distance To:
Author ID: slissenko.anatol Recent zbMATH articles by "Slissenko, Anatol"
Published as: Slissenko, Anatol; Slissenko, A.
External Links: MGP · Wikidata · GND
Documents Indexed: 23 Publications since 1995, including 3 Books
Biographic References: 1 Publication

Publications by Year

Citations contained in zbMATH Open

13 Publications have been cited 40 times in 30 Documents Cited by Year
Polytime algorithm for the shortest path in a homotopy class amidst semi-algebraic obstacles in the plane. Zbl 0961.14039
Grigoriev, D.; Slissenko, A.
6
1998
A logic of probability with decidable model-checking. Zbl 1021.03013
Beauquier, Danièle; Rabinovich, Alexander; Slissenko, Anatol
6
2002
A first order logic for specification of timed algorithms: Basic properties and a decidable class. Zbl 0988.03055
Beauquier, Danièle; Slissenko, Anatol
5
2002
Decidable classes of the verification problem in a timed predicate logic. Zbl 0941.03017
Beauquier, Danièle; Slissenko, Anatol
4
1999
Decidable verification for reducible timed automata specified in a first order logic with time. Zbl 1026.68079
Beauquier, Danièle; Slissenko, Anatol
4
2002
A logic of probability with decidable model checking. Zbl 1109.03017
Beauquier, Daniéle; Rabinovich, Alexander; Slissenko, Anatol
3
2006
Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon. Zbl 1075.68090
Burago, D.; Grigoriev, D.; Slissenko, A.
3
2004
On the complexity of finite memory policies for Markov decision processes. Zbl 1193.68126
Beauquier, Danièle; Burago, Dima; Slissenko, Anatol
2
1995
On the complexity of partially observed Markov decision processes. Zbl 0871.68081
Burago, Dima; de Rougemont, Michel; Slissenko, Anatol
2
1996
Polytime model checking for times probabilistic computation tree logic. Zbl 0910.68201
Beauquier, Danièle; Slissenko, Anatol
2
1998
Periodicity based decidable classes in a first order timed logic. Zbl 1094.03017
Beauquier, D.; Slissenko, A.
1
2006
Simulation of timed abstract state machines with predicate logic model-checking. Zbl 1217.68066
Slissenko, A.; Vasilyev, P.
1
2008
A logic framework for verification of timed algorithms. Zbl 1082.68068
Slissenko, Anatol
1
2004
Simulation of timed abstract state machines with predicate logic model-checking. Zbl 1217.68066
Slissenko, A.; Vasilyev, P.
1
2008
A logic of probability with decidable model checking. Zbl 1109.03017
Beauquier, Daniéle; Rabinovich, Alexander; Slissenko, Anatol
3
2006
Periodicity based decidable classes in a first order timed logic. Zbl 1094.03017
Beauquier, D.; Slissenko, A.
1
2006
Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon. Zbl 1075.68090
Burago, D.; Grigoriev, D.; Slissenko, A.
3
2004
A logic framework for verification of timed algorithms. Zbl 1082.68068
Slissenko, Anatol
1
2004
A logic of probability with decidable model-checking. Zbl 1021.03013
Beauquier, Danièle; Rabinovich, Alexander; Slissenko, Anatol
6
2002
A first order logic for specification of timed algorithms: Basic properties and a decidable class. Zbl 0988.03055
Beauquier, Danièle; Slissenko, Anatol
5
2002
Decidable verification for reducible timed automata specified in a first order logic with time. Zbl 1026.68079
Beauquier, Danièle; Slissenko, Anatol
4
2002
Decidable classes of the verification problem in a timed predicate logic. Zbl 0941.03017
Beauquier, Danièle; Slissenko, Anatol
4
1999
Polytime algorithm for the shortest path in a homotopy class amidst semi-algebraic obstacles in the plane. Zbl 0961.14039
Grigoriev, D.; Slissenko, A.
6
1998
Polytime model checking for times probabilistic computation tree logic. Zbl 0910.68201
Beauquier, Danièle; Slissenko, Anatol
2
1998
On the complexity of partially observed Markov decision processes. Zbl 0871.68081
Burago, Dima; de Rougemont, Michel; Slissenko, Anatol
2
1996
On the complexity of finite memory policies for Markov decision processes. Zbl 1193.68126
Beauquier, Danièle; Burago, Dima; Slissenko, Anatol
2
1995

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.