relation: http://eprints.imtlucca.it/2555/
title: Bottom-up beats top-down hands down
creator: Tribastone, Mirco
subject: QA75 Electronic computers. Computer science
description: In PEPA, the calculation of the transitions enabled by a process accounts for a large part of the time for the state space exploration of the underlying Markov chain. Unlike other approaches based on recursion, we present a new technique that is iterative—it traverses the process’ binary tree from the sequential components at the leaves up to the root. Empirical results shows that this algorithm is faster than a similar implementation employing recursion in Java. Finally, a study on the user-perceived performance compares our algorithm with those of other existing tools  (ipc/Hydra and the PEPA Workbench). 
publisher: AESOP
date: 2007-07
type: Book Section
type: NonPeerReviewed
identifier:   Tribastone, Mirco  Bottom-up beats top-down hands down.   In:  Proceedings of the 6th Workshop on Process Algebra and Stochastically Timed Activities (PASTA).   AESOP, pp. 97-104.     (Unpublished)   (2007)