The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nathalie Bertrand: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Christel Baier, Nathalie Bertrand, Ph. Schnoebelen
    Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness. [Citation Graph (0, 0)][DBLP]
    FORTE, 2006, pp:212-227 [Conf]
  2. Nathalie Bertrand, Ph. Schnoebelen
    Model Checking Lossy Channels Systems Is Probably Decidable. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:120-135 [Conf]
  3. Christel Baier, Nathalie Bertrand, Ph. Schnoebelen
    On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems. [Citation Graph (0, 0)][DBLP]
    LPAR, 2006, pp:347-361 [Conf]
  4. Nathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein
    Identifying and locating-dominating codes on chains and cycles. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:7, pp:969-987 [Journal]
  5. Nathalie Bertrand, Ph. Schnoebelen
    A Short Visit to the STS Hierarchy. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:154, n:3, pp:59-69 [Journal]
  6. Parosh Aziz Abdulla, Nathalie Bertrand, Alexander Moshe Rabinovich, Ph. Schnoebelen
    Verification of probabilistic systems with faulty communication. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:202, n:2, pp:141-165 [Journal]
  7. Christel Baier, Nathalie Bertrand, Ph. Schnoebelen
    A note on the attractor-property of infinite-state Markov chains. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:2, pp:58-63 [Journal]
  8. Christel Baier, Nathalie Bertrand, Ph. Schnoebelen
    On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  9. The Effect of Tossing Coins in Omega-Automata. [Citation Graph (, )][DBLP]


  10. On Decision Problems for Probabilistic Büchi Automata. [Citation Graph (, )][DBLP]


  11. Probabilistic and Topological Semantics for Timed Automata. [Citation Graph (, )][DBLP]


  12. When Are Timed Automata Determinizable? [Citation Graph (, )][DBLP]


  13. A Compositional Approach on Modal Specifications for Timed Systems. [Citation Graph (, )][DBLP]


  14. Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata. [Citation Graph (, )][DBLP]


  15. Qualitative Determinacy and Decidability of Stochastic Games with Signals. [Citation Graph (, )][DBLP]


  16. Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics. [Citation Graph (, )][DBLP]


  17. Probabilistic Acceptors for Languages over Infinite Words. [Citation Graph (, )][DBLP]


  18. Refinement and Consistency of Timed Modal Specifications. [Citation Graph (, )][DBLP]


  19. Verifying nondeterministic probabilistic channel systems against $\omega$-regular linear-time properties [Citation Graph (, )][DBLP]


  20. Determinacy and Decidability of Reachability Games with Partial Observation on Both Sides [Citation Graph (, )][DBLP]


  21. Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.004secs
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