Refinement and Difference for Probabilistic Automata

DOI10.2168/LMCS-10(3:11)2014zbMath1338.68144OpenAlexW4392629748MaRDI QIDQ2878759

Axel Legay, Uli Fahrenberg, Benoît Delahaye, Kim Guldstrand Larsen

Publication date: 5 September 2014

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doaj.org/article/ff49804158e94e009e7c107eda1bf7e6

zbMATH Keywords

distancedifferenceprobabilistic automatonspecification theory

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Compositionality for quantitative specifications

Uses Software

• PRISM
• CEGAR
• z3

This page was built for publication: Refinement and Difference for Probabilistic Automata