Verifying Finite State Machines in Probabilistic Environments


Abstract: Finite state machines are considered in a probabilistic environment that is generated by a Markov chain. An expressive temporal logic is introduced for specifying complex requirements that the FSM should satisfy in the given environment. The corresponding model checking algorithm is described and its symbolic implementation is sketched. Throughout… (More)


2 Figures and Tables