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.
Original language | English |
---|---|
Book series | Lecture Notes in Computer Science |
Pages (from-to) | 231-245 |
ISSN | 0302-9743 |
DOIs | |
Publication status | Published - 2007 |
Event | TACAS 2007 - Braga, Portugal Duration: 24 Mar 2007 → 1 Apr 2007 Conference number: 13 |
Conference
Conference | TACAS 2007 |
---|---|
Number | 13 |
Country/Territory | Portugal |
City | Braga |
Period | 24/03/2007 → 01/04/2007 |