Bottom-up beats top-down hands down

摘要: In PEPA, the calculation of transitions enabled by a process accounts for large part time state space exploration underlying Markov chain. Unlike other approaches based on recursion, we present new technique that is iterative—it traverses process’ binary tree from sequential components at leaves up to root. Empirical results shows this algorithm faster than similar implementation employing recursion in Java. Finally, study user-perceived performance compares our with those existing tools (ipc/Hydra and PEPA Workbench).