Nathalie Bertrand

According to our database1, Nathalie Bertrand
  • authored at least 58 papers between 2003 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Controlling a Population.
CoRR, 2017

When are Stochastic Transition Systems Tameable?
CoRR, 2017

Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes.
Acta Inf., 2017

Controlling a Population.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
Editorial: Quantitative Aspects of Programming Languages and Systems.
Theor. Comput. Sci., 2016

Accurate Approximate Diagnosability of Stochastic Systems.
Proceedings of the Language and Automata Theory and Applications, 2016

Analysing Decisive Stochastic Processes.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Diagnosis in Infinite-State Probabilistic Systems.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
A game approach to determinize timed automata.
Formal Methods in System Design, 2015

Distributed Local Strategies in Broadcast Networks.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

Contributions to the verification and control of timed and probabilistic models : Mémoire d'habilitation à diriger des recherches.
, 2015

2014
Stochastic Timed Automata.
Logical Methods in Computer Science, 2014

Deciding the Value 1 Problem for Reachability in 1-Clock Decision Stochastic Timed Automata.
Proceedings of the Quantitative Evaluation of Systems - 11th International Conference, 2014

Foundation of Diagnosis and Predictability in Probabilistic Systems.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Playing with Probabilities in Reconfigurable Broadcast Networks.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

Active Diagnosis for Probabilistic Systems.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

2013
Computable fixpoints in well-structured symbolic model checking.
Formal Methods in System Design, 2013

Solving Stochastic Büchi Games on Infinite Decisive Arenas.
Proceedings of the Proceedings 11th International Workshop on Quantitative Aspects of Programming Languages and Systems, 2013

Emptiness and Universality Problems in Timed Automata with Positive Frequency.
CoRR, 2013

Transient Analysis of Networks of Stochastic Timed Automata Using Stochastic State Classes.
Proceedings of the Quantitative Evaluation of Systems - 10th International Conference, 2013

The Steady-State Control Problem for Markov Decision Processes.
Proceedings of the Quantitative Evaluation of Systems - 10th International Conference, 2013

Parameterized Verification of Many Identical Probabilistic Timed Processes.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012
Modal event-clock specifications for timed component-based design.
Sci. Comput. Program., 2012

Probabilistic ω-automata.
J. ACM, 2012

Off-line test selection with test purposes for non-deterministic timed automata
Logical Methods in Computer Science, 2012

Bounded Satisfiability for PCTL
CoRR, 2012

On the Decidability Status of Reachability and Coverability in Graph Transformation Systems.
Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

Playing Optimally on Timed Automata with Random Delays.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2012

Bounded Satisfiability for PCTL.
Proceedings of the Computer Science Logic (CSL'12), 2012

2011
Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2011

Emptiness and Universality Problems in Timed Automata with Positive Frequency.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Minimal Disclosure in Partially Observable Markov Decision Processes.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

A Game Approach to Determinize Timed Automata.
Proceedings of the Foundations of Software Science and Computational Structures, 2011

2010
Probabilistic regular graphs
Proceedings of the Proceedings 12th International Workshop on Verification of Infinite-State Systems, 2010

2009
Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability
Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

Probabilistic Acceptors for Languages over Infinite Words.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Qualitative Determinacy and Decidability of Stochastic Games with Signals.
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

Refinement and Consistency of Timed Modal Specifications.
Proceedings of the Language and Automata Theory and Applications, 2009

A Compositional Approach on Modal Specifications for Timed Systems.
Proceedings of the Formal Methods and Software Engineering, 2009

When Are Timed Automata Determinizable?
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

The Effect of Tossing Coins in Omega-Automata.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008
Determinacy and Decidability of Reachability Games with Partial Observation on Both Sides
CoRR, 2008

Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics.
Proceedings of the Fifth International Conference on the Quantitative Evaluaiton of Systems (QEST 2008), 2008

Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

On Decision Problems for Probabilistic Büchi Automata.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

2007
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties.
ACM Trans. Comput. Log., 2007

Probabilistic and Topological Semantics for Timed Automata.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006
Modèles stochastiques pour les pertes de messages dans les protocoles asynchrones, et techniques de vérification automatique. (Stochastic models for Lossy Channel Systems and automated verification techniques).
PhD thesis, 2006

A note on the attractor-property of infinite-state Markov chains.
Inf. Process. Lett., 2006

A Short Visit to the STS Hierarchy.
Electr. Notes Theor. Comput. Sci., 2006

On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems
CoRR, 2006

On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems.
Proceedings of the Logic for Programming, 2006

Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2006

2005
Verification of probabilistic systems with faulty communication.
Inf. Comput., 2005

Verifying nondeterministic probabilistic channel systems against $\omega$-regular linear-time properties
CoRR, 2005

1-identifying codes on trees.
Australasian J. Combinatorics, 2005

2004
Identifying and locating-dominating codes on chains and cycles.
Eur. J. Comb., 2004

2003
Model Checking Lossy Channels Systems Is Probably Decidable.
Proceedings of the Foundations of Software Science and Computational Structures, 2003


  Loading...