Abstract
In this paper, we describe a new flexible framework for state space exploration based on cooperating agents. The idea is to let various agents with different search patterns explore the state space individually and communicate information about fruitful subpaths of the search tree to each other. That way very complex global search behavior is achieved with very simple local behavior. As an example agent behavior, we propose a novel anytime randomized search strategy called frustration search. The effectiveness of the framework is illustrated in the setting of priced timed automata on a number of case studies.
Originalsprog | Engelsk |
---|---|
Bogserie | Lecture Notes in Computer Science |
Sider (fra-til) | 231-245 |
ISSN | 0302-9743 |
DOI | |
Status | Udgivet - 2007 |
Begivenhed | TACAS 2007 - Braga, Portugal Varighed: 24 mar. 2007 → 1 apr. 2007 Konferencens nummer: 13 |
Konference
Konference | TACAS 2007 |
---|---|
Nummer | 13 |
Land/Område | Portugal |
By | Braga |
Periode | 24/03/2007 → 01/04/2007 |
Bibliografisk note
ISBN 978-3-540-71208-4ISSN 1611-3349 (Online)
Udgivelsesdato: 05.07.2007
Volumne: 4424