TY  - UNPB
Y1  - 2007/07//
TI  - Bottom-up beats top-down hands down
AV  - none
UR  - http://eprints.imtlucca.it/2555/
PB  - AESOP
A1  - Tribastone, Mirco
SP  - 97
N2  - 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). 
N1  - 6th Workshop on Process Algebra and Stochastically Timed Activities (PASTA) held in Edindurgh (UK), July 2007
ID  - eprints2555
EP  - 104
T2  - Proceedings of the 6th Workshop on Process Algebra and Stochastically Timed Activities (PASTA)
ER  -