eprintid: 2555
rev_number: 8
eprint_status: archive
userid: 6
dir: disk0/00/00/25/55
datestamp: 2015-02-06 10:14:24
lastmod: 2015-02-06 10:14:24
status_changed: 2015-02-06 10:14:24
type: book_section
metadata_visibility: show
creators_name: Tribastone, Mirco
creators_id: mirco.tribastone@imtlucca.it
title: Bottom-up beats top-down hands down
ispublished: unpub
subjects: QA75
divisions: CSA
full_text_status: none
pres_type: paper
note: 6th Workshop on Process Algebra and Stochastically Timed Activities (PASTA) held in Edindurgh (UK), July 2007
abstract: 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). 
date: 2007-07
date_type: published
publisher: AESOP
pagerange: 97-104
event_location: Edinburgh (UK)
event_dates: July 2007
event_type: workshop
refereed: FALSE
book_title: Proceedings of the 6th Workshop on Process Algebra and Stochastically Timed Activities (PASTA)
citation:   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)