The following pages link to Rayna Dimitrova (Q1683927):
Displayed 19 items.
- Approximate counting in SMT and value estimation for probabilistic programs (Q1683928) (← links)
- Reachability analysis of reversal-bounded automata on series-parallel graphs (Q1741900) (← links)
- Symbolic model checking for factored probabilistic models (Q1990523) (← links)
- Probabilistic \(\mathrm{CTL}^*\): the deductive way (Q2272920) (← links)
- Reactive synthesis with maximum realizability of linear temporal logic specifications (Q2303876) (← links)
- Model Checking Information Flow in Reactive Systems (Q2891409) (← links)
- Abstraction Refinement for Games with Incomplete Information. (Q3165957) (← links)
- Approximate Automata for Omega-Regular Languages (Q3297599) (← links)
- (Q3388743) (← links)
- Synthesis of Fault-Tolerant Distributed Systems (Q3648709) (← links)
- Counterexample-Guided Synthesis of Observation Predicates (Q4649389) (← links)
- (Q5013881) (← links)
- (Q5028468) (← links)
- The Robot Routing Problem for Collecting Aggregate Stochastic Rewards (Q5111626) (← links)
- Approximate Counting in SMT and Value Estimation for Probabilistic Programs (Q5194954) (← links)
- Is Lazy Abstraction a Decision Procedure for Broadcast Protocols? (Q5452710) (← links)
- Maximum realizability for linear temporal logic specifications (Q6109602) (← links)
- Synthesizing approximate implementations for unrealizable specifications (Q6194576) (← links)
- Probabilistic Hyperproperties of Markov Decision Processes (Q6485906) (← links)