- Time-Bounded Reachability in Tree-Structured QBDs by Abstraction Daniel Klink Anne Remke Boudewijn R. Haverkort Joost-Pieter Katoen Fri 07 December 2012
- The complexity of probabilistic verification Costas Courcoubetis Mihalis Yannakakis Tue 04 December 2012
- Reasoning about Time and Probability Keiji Kanazawa Tue 04 December 2012
- Reasoning with time and chance Daniel Lehmann Saharon Shelah Tue 04 December 2012
Library Size: 13G (4 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A
