Abstract
The models we considered in this paper are uniformed nondeterminism interactive Markov chains (IMCs). To give the performance specification of IMCs, we first give an algorithm to compute the optimize path probability to reach a set of goal states within a given time bound on an IMC MD, which describing until operator. Using an action-based logic called aCSL the properties of interesting over the IMCs models are described. The correctness of our describing method is proved. It is an extension of performance evaluation pure continue-time Markov chains.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
