1995
DOI: 10.1007/bfb0027062
|View full text |Cite
|
Sign up to set email alerts
|

Generic, configurable, cooperation protocols for multi-agent systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

1995
1995
2010
2010

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 23 publications
(7 citation statements)
references
References 10 publications
0
7
0
Order By: Relevance
“…The extensive program underway at the Free University of Amsterdam on compositional methodologies for requirements [11], design [4], and verification [14] uses graphical representations with strong links to UML's collaboration diagrams, as well as linear (formulaic) notations better suited to alignment with UML's metamodel than with the graphical mechanisms that are our focus. Our discussion of the compositionality of protocols is anticipated in the work of Burmeister et al [7], though our notation differs widely from hers. Dooley graphs facilitate the identification of the "character" that results from an agent playing a specific role (as distinct from the same agent playing a different role) [21,27].…”
Section: Agent Software Methodologiesmentioning
confidence: 99%
See 1 more Smart Citation
“…The extensive program underway at the Free University of Amsterdam on compositional methodologies for requirements [11], design [4], and verification [14] uses graphical representations with strong links to UML's collaboration diagrams, as well as linear (formulaic) notations better suited to alignment with UML's metamodel than with the graphical mechanisms that are our focus. Our discussion of the compositionality of protocols is anticipated in the work of Burmeister et al [7], though our notation differs widely from hers. Dooley graphs facilitate the identification of the "character" that results from an agent playing a specific role (as distinct from the same agent playing a different role) [21,27].…”
Section: Agent Software Methodologiesmentioning
confidence: 99%
“…Burmeister et al suggest a similar construct when they describe their complex cooperation protocols [7]. Their three primitive protocols-offering, requesting, and proposing-"are general enough to be used in a large number of interaction situations."…”
Section: Packagesmentioning
confidence: 99%
“…Classically, the syntactic constraints may be modeled and implemented using finite state machines (FSA) whose vertices represent the system's conversational states and edges correspond to conversational events [7]. Petri nets are also sometimes used [9], and like FSA, they basically consist in specifying by extension all possible sequences of states and messages that represent conversation courses.…”
Section: Limitations Of Finite State Machinesmentioning
confidence: 99%
“…The design of protocols Burmeister et al, 1995 classically reHes on building a graph, where vertices represent the system's conversational states, Le., the current state of the conversation the agents are participating in, and where edges correspond to conversational events, i.e., the sending or receiving of a message. Such protocol graphs describe the possible conversation courses.…”
Section: The Communication Issue Is Typically Addressed By Means Of Imentioning
confidence: 99%