Time Reversibility modulo State Renaming for Probabilistic Concurrent Automata

Abstract

The dimension problem of states space makes the computation of quantitative data impractical due to the memory and time requirements. To this scope, time reversibility plays an important role on the analysis of these processes. Moreover, is defined the class of reversibility for the probabilistic automata with renaming of states space, a crucial point for our analysis and further studies. Is introduced also the notion of the stationary distribution for the probablistic automata to verify and complete the work on this thesis.