Logo eprints

Bottom-up beats top-down hands down

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)

Full text not available from this repository.


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).

Item Type: Book Section
Additional Information: 6th Workshop on Process Algebra and Stochastically Timed Activities (PASTA) held in Edindurgh (UK), July 2007
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Research Area: Computer Science and Applications
Depositing User: Ms T. Iannizzi
Date Deposited: 06 Feb 2015 10:14
Last Modified: 06 Feb 2015 10:14
URI: http://eprints.imtlucca.it/id/eprint/2555

Actions (login required)

Edit Item Edit Item