The following pages link to Luis María Ferrer Fioriti (Q282102):
Displaying 10 items.
- Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
- Probabilistic \(\mathrm{CTL}^*\): the deductive way (Q2272920) (← links)
- Cost vs. time in stochastic games and Markov automata (Q2403526) (← links)
- Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms (Q2453112) (← links)
- Probabilistic Termination (Q2819834) (← links)
- Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers (Q3184684) (← links)
- Synthesizing Probabilistic Invariants via Doob’s Decomposition (Q4633526) (← links)
- Variable Probabilistic Abstraction Refinement (Q4649305) (← links)
- Abstraction-Based Computation of Reward Measures for Markov Automata (Q5172642) (← links)
- Cost vs. Time in Stochastic Games and Markov Automata (Q5351873) (← links)