2009
DOI: 10.1093/jigpal/jzp071
|View full text |Cite
|
Sign up to set email alerts
|

Executable specification of open multi-agent systems

Abstract: Abstract. Multi-agent systems where the agents are developed by parties with competing interests, and where there is no access to an agent's internal state, are often classified as 'open'. The members of such systems may inadvertently fail to, or even deliberately choose not to, conform to the system specification. Consequently, it is necessary to specify the normative relations that may exist between the members, such as permission, obligation, and institutional power. We present a framework being developed f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 34 publications
(28 citation statements)
references
References 63 publications
0
28
0
Order By: Relevance
“…Instead we have added pointers to related work wherever possible throughout the presentation. An extensive discussion of the relation between our framework and other normative systems, such as [2,8,11,17,19] to name but a few, can be found in [5,4].…”
Section: Discussionmentioning
confidence: 99%
“…Instead we have added pointers to related work wherever possible throughout the presentation. An extensive discussion of the relation between our framework and other normative systems, such as [2,8,11,17,19] to name but a few, can be found in [5,4].…”
Section: Discussionmentioning
confidence: 99%
“…In general, an agent is sanctioned when performing a forbidden action or not complying with an obligation. A few examples of sanctions will be shown presently (a more thorough treatment of sanctions may be found in [5,7]). Finally, a subject is never obliged to request the floor.…”
Section: A Static Resource-sharing Protocolmentioning
confidence: 99%
“…From rule (5), and the fact that s |= best candidate = S ∧ ∀S ¬holder (S ) ∧ role of (C ) = chair we have that powAssign(C , S ) ∈ T static (s). According to our initial assumption, however, in s the chair C is not empowered to assign the floor to S, that is,…”
Section: Proving Properties Of the Static Resource-sharing Protocolmentioning
confidence: 99%
See 2 more Smart Citations