Abstract
The algorithm of Table 3.1 computes Markovian bisimilarity on S. It can be implemented with a time complexity of O(mM log n) where mM is the number of Markovian transitions and n is the number of states. The space complexity of this implementation is O(mM).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hermanns, H. (2002). Proofs for Chapter 3 and Chapter 4. In: Interactive Markov Chains. Lecture Notes in Computer Science, vol 2428. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45804-2_8
Download citation
DOI: https://doi.org/10.1007/3-540-45804-2_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44261-5
Online ISBN: 978-3-540-45804-3
eBook Packages: Springer Book Archive