On the Complexity of the Equivalence Problem for Probabilistic Automata
Attributed to:
Automated Verification of Probabilistic Programs
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/978-3-642-28729-9_31
Publication URI: http://dx.doi.org/10.1007/978-3-642-28729-9_31
Type: Book Chapter
Book Title: Foundations of Software Science and Computational Structures (2012)
Page Reference: 467-481
ISBN: 978-3-642-28728-2