|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 29 publication records. Showing 29 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Christel Baier, Marcus Größer, Nathalie Bertrand |
Probabilistic ω-automata.  |
J. ACM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand, John Fearnley, Sven Schewe |
Bounded Satisfiability for PCTL  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Nathalie Bertrand, Thierry Jéron, Amélie Stainer, Moez Krichen |
Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata.  |
TACAS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer |
Emptiness and Universality Problems in Timed Automata with Positive Frequency.  |
ICALP  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand, Amélie Stainer, Thierry Jéron, Moez Krichen |
A Game Approach to Determinize Timed Automata.  |
FOSSACS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand, Blaise Genest |
Minimal Disclosure in Partially Observable Markov Decision Processes.  |
FSTTCS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand, Christophe Morvan |
Probabilistic regular graphs  |
INFINITY  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christel Baier, Nathalie Bertrand, Marcus Größer |
Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability  |
DCFS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christel Baier, Nathalie Bertrand, Marcus Größer |
The Effect of Tossing Coins in Omega-Automata.  |
CONCUR  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand, Axel Legay, Sophie Pinchinat, Jean-Baptiste Raclet |
A Compositional Approach on Modal Specifications for Timed Systems.  |
ICFEM  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand, Sophie Pinchinat, Jean-Baptiste Raclet |
Refinement and Consistency of Timed Modal Specifications.  |
LATA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye |
When Are Timed Automata Determinizable?  |
ICALP  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand, Blaise Genest, Hugo Gimbert |
Qualitative Determinacy and Decidability of Stochastic Games with Signals.  |
LICS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christel Baier, Nathalie Bertrand, Marcus Größer |
Probabilistic Acceptors for Languages over Infinite Words.  |
SOFSEM  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand, Blaise Genest, Hugo Gimbert |
Determinacy and Decidability of Reachability Games with Partial Observation on Both Sides  |
CoRR  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Nicolas Markey |
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics.  |
QEST  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer |
Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata.  |
LICS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Christel Baier, Nathalie Bertrand, Marcus Größer |
On Decision Problems for Probabilistic Büchi Automata.  |
FoSSaCS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Christel Baier, Nathalie Bertrand, Ph. Schnoebelen |
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties.  |
ACM Trans. Comput. Log.  |
2007 |
DBLP DOI BibTeX RDF |
lossy channels, probabilistic models, Communication protocols, Markov decision processes |
| 1 | Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer |
Probabilistic and Topological Semantics for Timed Automata.  |
FSTTCS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christel Baier, Nathalie Bertrand, Ph. Schnoebelen |
A note on the attractor-property of infinite-state Markov chains.  |
Inf. Process. Lett.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand, Ph. Schnoebelen |
A Short Visit to the STS Hierarchy.  |
Electr. Notes Theor. Comput. Sci.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christel Baier, Nathalie Bertrand, Ph. Schnoebelen |
On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems  |
CoRR  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Christel Baier, Nathalie Bertrand, Ph. Schnoebelen |
Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness.  |
FORTE  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christel Baier, Nathalie Bertrand, Ph. Schnoebelen |
On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems.  |
LPAR  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Nathalie Bertrand, Alexander Moshe Rabinovich, Ph. Schnoebelen |
Verification of probabilistic systems with faulty communication.  |
Inf. Comput.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Christel Baier, Nathalie Bertrand, Ph. Schnoebelen |
Verifying nondeterministic probabilistic channel systems against $\omega$-regular linear-time properties  |
CoRR  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Nathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein |
Identifying and locating-dominating codes on chains and cycles.  |
Eur. J. Comb.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand, Ph. Schnoebelen |
Model Checking Lossy Channels Systems Is Probably Decidable.  |
FoSSaCS  |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #29 of 29 (100 per page; Change: )
|
|