The following pages link to Nathalie Bertrand (Q1045895):
Displaying 50 items.
- A note on the attractor-property of infinite-state Markov chains (Q1045897) (← links)
- When are stochastic transition systems tameable? (Q1648646) (← links)
- Identifying and locating-dominating codes on chains and cycles (Q1883609) (← links)
- Modal event-clock specifications for timed component-based design (Q1951603) (← links)
- A game approach to determinize timed automata (Q2018058) (← links)
- Diagnosis and degradation control for probabilistic systems (Q2220350) (← links)
- A reduction theorem for randomized distributed algorithms under weak adversaries (Q2234073) (← links)
- A tale of two diagnoses in probabilistic systems (Q2280320) (← links)
- Parameterized verification of synchronization in constrained reconfigurable broadcast networks (Q2324224) (← links)
- Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes (Q2407982) (← links)
- Verification of probabilistic systems with faulty communication (Q2573634) (← links)
- Accurate Approximate Diagnosability of Stochastic Systems (Q2798748) (← links)
- (Q2852063) (← links)
- (Q2911642) (← links)
- Stochastic Timed Automata (Q2938760) (← links)
- (Q2963938) (← links)
- (Q2978532) (← links)
- A Game Approach to Determinize Timed Automata (Q3000613) (← links)
- Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata (Q3000640) (← links)
- Emptiness and Universality Problems in Timed Automata with Positive Frequency (Q3012924) (← links)
- Off-line test selection with test purposes for non-deterministic timed automata (Q3166229) (← links)
- The Effect of Tossing Coins in Omega-Automata (Q3184662) (← links)
- Probabilistic Acceptors for Languages over Infinite Words (Q3599062) (← links)
- Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness (Q3613069) (← links)
- Refinement and Consistency of Timed Modal Specifications (Q3618577) (← links)
- When Are Timed Automata Determinizable? (Q3638084) (← links)
- (Q4417855) (← links)
- Analysing Decisive Stochastic Processes (Q4598242) (← links)
- Diagnosis in Infinite-State Probabilistic Systems (Q4608690) (← links)
- Qualitative Determinacy and Decidability of Stochastic Games with Signals (Q4640298) (← links)
- Playing Optimally on Timed Automata with Random Delays (Q4649385) (← links)
- Bounded Satisfiability for PCTL (Q4649540) (← links)
- (Q4659582) (← links)
- (Q4992528) (← links)
- (Q5089158) (← links)
- (Q5111624) (← links)
- On the Decidability Status of Reachability and Coverability in Graph Transformation Systems (Q5111899) (← links)
- Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes (Q5145280) (← links)
- (Q5146511) (← links)
- (Q5227518) (← links)
- Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties (Q5277794) (← links)
- Distributed local strategies in broadcast networks (Q5357693) (← links)
- On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems (Q5387903) (← links)
- Probabilistic ω-automata (Q5395674) (← links)
- Active Diagnosis for Probabilistic Systems (Q5410662) (← links)
- Playing with Probabilities in Reconfigurable Broadcast Networks (Q5410669) (← links)
- On Decision Problems for Probabilistic Büchi Automata (Q5458366) (← links)
- Probabilistic and Topological Semantics for Timed Automata (Q5458833) (← links)
- Uncertainty related to high resolution topographic data use for flood event modeling over urban areas: toward a sensitivity analysis approach (Q5744939) (← links)
- (Q5856427) (← links)
