MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Anatol Slissenko" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

11 documents found, showing 1 through 10. Next 10 →

ATOM

Decidable Verification for Reducible Timed Automata Specified in a First Order Logic with Time
by Daniele Beauquier, Anatol Slissenko, Anatol Slissenko — 1998 — Theoretical Computer Science
…. Dani`ele Beauquier Anatol Slissenko October 1998 TR--98--16 INFORMATIQUE Universit'e Paris 12 -- Val…
Add To MetaCart

Polytime Model Checking for Timed Probabilistic Computation Tree Logic.
by Danièle Beauquier, Anatol Slissenko, Anatol Slissenko — 1996 — Acta Inf
… Anatol Slissenko 2 Universit'e Paris-12 and L.I.T.P., Paris, France and Laboratory for Theory…
Cited by 4 (1 self) – Add To MetaCart

A.: Verification of timed algorithms: Gurevich abstract state machines versus first order timed logic
by Danièle Beauquier, Anatol Slissenko — In: Proc. of ASM 2000 International Workshop (March 2000) Fragments of Many-Sorted Logic 31
… Danièle Beauquier 1 Dept. of Informatics, University Paris-12, France Anatol Slissenko 2† Dept…
Cited by 1 (0 self) – Add To MetaCart

A Logic of Probability With Decidable Model-Checking
by Daniele Beauquier, Alexander Rabinovich, Anatol Slissenko — 2001
…, France Alexander Rabinovich 2 Tel-Aviv University, Israel Anatol Slissenko 3 University Paris-12…
Cited by 1 (0 self) – Add To MetaCart

A Logic of Probability With Decidable Model-Checking
by Daniele Beauquier University, Daniele Beauquier, Alexander Rabinovich, Anatol Slissenko — Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic (2002
…@(email omitted); Anatol Slissenko 1 # University Paris-12, France slissenko@(email omitted); Abstract A predicate…
Add To MetaCart

The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and their Model Checking in High Level Languages.
by D. Beauquier, Facult Des Sciences Et Technologie, Anatol Slissenko — 1996
…, France Anatol Slissenko 1 [ Universit'e Paris-12 and L.I.T.P., Paris, France and Laboratory for Theory…
Cited by 6 (3 self) – Add To MetaCart

On the Complexity of Partially Observed Markov Decision Processes
by Dima Burago, Michel De Rougemont, Anatol Slissenko — 1996 — Theoretical Computer Science
… Michel de Rougemont 2 Laboratoire de Recherche en Informatique, Universit'e Paris-Sud, France Anatol…
Cited by 22 (2 self) – Add To MetaCart

A First Order Logic for Specification of Timed Algorithms: Basic Properties and a Decidable Class
by Danièle Beauquier, Facult Des Sciences Et Technologie, Anatol Slissenko, Anatol Slissenko — 1999
… and a Decidable Class Daniele Beauquier Anatol Slissenko June 2000 TR{00-23 INFORMATIQUE Universite…
Cited by 10 (5 self) – Add To MetaCart

A Logic of Probability With Decidable
by Model-Checking Beauquier And, Danièle Beauquier, Anatol Slissenko, Alexander Rabinovich — 2003 — Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic (2002
… Beauquier 1♯ University Paris 12, France beauquier@(email omitted); 1 ♯ Anatol Slissenko University Paris-12…
Add To MetaCart

A Predicate Logic Framework for Mechanical Verification of Real-Time Abstract State . . .
by Danièle Beauquier, Facult Des Sciences Et Technologie, Anatol Slissenko, D. Beauquier, T. Crolard, A. Slissenko, Tristan Crolard, Tristan Crolard — 2000
…-Time Abstract State Machines: A Case Study with PVS. Daniele Beauquier Tristan Crolard Anatol Slissenko…
Cited by 1 (1 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB