Lazy Determinisation for Quantitative Model Checking.
Year: 2013
Type: preprint
Abstract: The bottleneck in the quantitative analysis of Markov chains and Markov decision processes against specifications given in LTL or as some form of nondeterministic Buchi automata is the inclusion of a determinisation step of the automaton under consideration. Such determinisation constructions are notoriously difficult and cumbersome to implement. In this paper we argue that applying this step in full generality is only required in some places, and can often be circumvented by subset and breakpoint constructions. We have implemented our approach in a prototype tool. Our experiments show that our prototype can compete with mature tools like PRISM.
Source: arXiv (Cornell University)
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2400172338