21 citations · 53 across the 22 of their papers we have counts for
Showing 2026 · cs.LOShow all
2 papers · 2 filters
cs.LO2026
Effective Stochastic Automata Model Checking by Interval Abstraction (extended version)
Pedro R. D'Argenio, Arnd Hartmanns, Annabell Petri
Stochastic automata (SA) are a formal stochastic continuous-time model based on countdown timers whose expiration times follow general probability distributions. SA are particularl…
cs.LO2026
UMB: A Unified Markov Binary Format for Probabilistic Model Checking (extended version)
Roman Andriushchenko, Arnd Hartmanns, Joshua Jeppson +5
This paper presents the unified Markov binary (UMB) format, an efficient, extensible, and well-supported explicit-state file format for representing a wide range of probabilistic s…