You can manage bookmarks using lists, please log in to your user account for this.
Media type:
E-Book;
Report;
Text
Title:
Heuristic Search for Unbounded Executions
Contributor:
Kuntz, Matthias
[Author];
Leue, Stefan
[Author];
Scheben, Christoph
[Author];
Wei, Wei
[Author];
Yang, Sen
[Author]
imprint:
KOPS - The Institutional Repository of the University of Konstanz, 2009
Language:
English
Origination:
Footnote:
Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
Description:
We present a heuristic search based approach to finding un- bounded executions in software models that can be described using Com- municating Finite State Machines (CFSMs). This improves the unbound- edness test devised by Jeron and Jard in case certain knowledge about potential sources of unboundedness is available. Such knowledge can be obtained from a boundedness analysis that we designed in precursory work. We evaluate the effectiveness of several different heuristics and search strategies. To show the feasibility of our approach, we compare the performance of the heuristic search algorithms with that of uninformed search algorithms in detecting unbounded executions for a number of case studies. We discuss the applicability of our approach to high level modeling languages for concurrent systems such as Promela. ; published