2000
DOI: 10.1007/10722777_13
|View full text |Cite
|
Sign up to set email alerts
|

A Schema-Based Approach to Specifying Conversation Policies

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2001
2001
2007
2007

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 19 publications
(17 citation statements)
references
References 9 publications
0
17
0
Order By: Relevance
“…We make use of two initially empty, temporary sets, ∆ 1 , ∆ 2 . The algorithm loops through ∆ (lines [16][17][18][19][20][21][22][23][24][25] picking up those annotated prohibitions N Σ which conflict with the new obligation. There are, however, two cases to deal with: the one when a ground prohibition is found (line 17), and its exception, covering non-ground prohibitions (line 20).…”
Section: Conflict Resolutionmentioning
confidence: 99%
See 2 more Smart Citations
“…We make use of two initially empty, temporary sets, ∆ 1 , ∆ 2 . The algorithm loops through ∆ (lines [16][17][18][19][20][21][22][23][24][25] picking up those annotated prohibitions N Σ which conflict with the new obligation. There are, however, two cases to deal with: the one when a ground prohibition is found (line 17), and its exception, covering non-ground prohibitions (line 20).…”
Section: Conflict Resolutionmentioning
confidence: 99%
“…Any attempt to insert a ground prohibition which conflicts, yields the same normative state (line 4). When a new obligation is being added then the algorithm guarantees that all prohibitions are considered (lines [14][15][16][17][18][19][20][21][22][23][24][25][26][27], leading to the removal of conflicting ground prohibitions or the update of annotations of non-ground prohibitions. The algorithm always terminates: the loops are over a finite set ∆ and the conflict checks and set operations always terminate.…”
Section: Conflict Resolutionmentioning
confidence: 99%
See 1 more Smart Citation
“…Most investigations choose to separately represent individual roles within the interaction [1,2,4,5]. Separate places are used for separate roles, and thus different markings distinguish a conversation state where one agent has sent a message, from a state where the other agent received it.…”
Section: Individual Roles and Colored Petri Nets (Cp-nets)mentioning
confidence: 99%
“…Then, letting the corresponding transition fire implies the message being sent and received. Previous investigations using this approach include [1,4,5].…”
Section: Monitoring Conversationsmentioning
confidence: 99%