Abstract
In this paper, we consider a problem of reduction of probabilistic transition systems (PTS) in order to reduce the complexity of model checking of such systems. The problem of model checking of a PTS is to calculate truth values of formulas of the probabilistic temporal logic PCTL in an initial state of the PTS. We introduce the concept of equivalence of states of a PTS and present an algorithm for removing equivalent states. A result of this algorithm is a PTS such that all of its properties expressed by formulas of PCTL coincide with those of the original PTS.
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.
