Preprint
Sep 2026
Quantitative coverability for probabilistic well-structured transition systems
Well-structured transition systems (WSTS) provide a classical framework for the verification of infinite-state systems, but their probabilistic extensions lack a unified treatment of quantitative coverability: path-enumeration algorithms assume a finite branching degree, while alternative approximation schemes defer so...
Raphaëlle Faure, Alain Finkel, Gaspard Fougea et al.
· 0 citations