Complexity in Simplicity: Flexible Agent-based State Space Exploration

Jacob Illum Rasmussen, Kim Guldstrand Larsen

Research output: Contribution to journalConference article in JournalResearchpeer-review

5 Citations (Scopus)

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 languageEnglish
Book seriesLecture Notes in Computer Science
Pages (from-to)231-245
ISSN0302-9743
DOIs
Publication statusPublished - 2007
EventTACAS 2007 - Braga, Portugal
Duration: 24 Mar 20071 Apr 2007
Conference number: 13

Conference

ConferenceTACAS 2007
Number13
CountryPortugal
CityBraga
Period24/03/200701/04/2007

Fingerprint

Simplicity
State Space
Pattern Search
Frustration
Timed Automata
Global Search
Search Trees
Search Strategy
Framework

Cite this

@inproceedings{d1608390a6e011dbb8eb000ea68e967b,
title = "Complexity in Simplicity: Flexible Agent-based State Space Exploration",
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.",
author = "Rasmussen, {Jacob Illum} and Larsen, {Kim Guldstrand}",
note = "ISBN 978-3-540-71208-4 ISSN 1611-3349 (Online) Udgivelsesdato: 05.07.2007 Volumne: 4424",
year = "2007",
doi = "10.1007/978-3-540-71209-1_19",
language = "English",
pages = "231--245",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Publishing Company",

}

Complexity in Simplicity: Flexible Agent-based State Space Exploration. / Rasmussen, Jacob Illum; Larsen, Kim Guldstrand.

In: Lecture Notes in Computer Science, 2007, p. 231-245.

Research output: Contribution to journalConference article in JournalResearchpeer-review

TY - GEN

T1 - Complexity in Simplicity: Flexible Agent-based State Space Exploration

AU - Rasmussen, Jacob Illum

AU - Larsen, Kim Guldstrand

N1 - ISBN 978-3-540-71208-4 ISSN 1611-3349 (Online) Udgivelsesdato: 05.07.2007 Volumne: 4424

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-540-71209-1_19

DO - 10.1007/978-3-540-71209-1_19

M3 - Conference article in Journal

SP - 231

EP - 245

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -