Browse by author
Lookup NU author(s): Dr Victor Khomenko
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
In this paper, we first present theoretical results, helping to understand the unfolding algorithm presented in [6],[7]. We then propose a modification of this algorithm, which can be efficiently parallelised and admits a more efficient implementation. Our experiments demonstrate that the degree of parallelism is usually quite high and resulting algorithms potentially can achieve significant speedup comparing with the sequential case.
Author(s): Heljanko K, Khomenko V, Koutny M
Editor(s): Katoen, J.-P., Stevens, P.
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2002), held as Part of the Joint European Conference on Theory and Practice of Software (ETAPS)
Year of Conference: 2002
Pages: 371-385
ISSN: 0302-9743 (Print) 1611-3349 (Online)
Publisher: Springer-Verlag
URL: http://dx.doi.org/10.1007/3-540-46002-0_26
DOI: 10.1007/3-540-46002-0_26
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science
ISBN: 3540434194
