Lookup NU author(s): Professor Maciej Koutny
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
Automated verification of dynamic multi-threaded computing systems can be adversely affected by problems relating to dynamic process creation. We therefore investigate - in a general setting of labelled transition systems - a way of reducing the state spaces of multi-threaded systems. At the heart of our method is a state equivalence, which may produce a finite representation of an infinite state system while still allowing to validate the relevant behavioural properties. We demonstrate the feasibility of the method through experiments involving the checking of the proposed state equivalence.
Author(s): Klaudel H, Koutny M, Pelz E, Pommereau F
Editor(s): Vural, F.Y., Yazici, A., Toroslu, H. et al.
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: 24th International Symposium on Computer and Information Sciences
Year of Conference: 2009
Library holdings: Search Newcastle University Library for this item