Transaction Management Support for Cooperative Applications 1998
DOI: 10.1007/978-1-4615-5679-4_6
|View full text |Cite
|
Sign up to set email alerts
|

The Transcoop Specification Environment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

1998
1998
1998
1998

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(7 citation statements)
references
References 0 publications
0
7
0
Order By: Relevance
“…The COCOA coordination model [FEdB96,FEdBA97,FEdB98], developed at the University of Twente, offers a rich set of primitives to describe the organizational structure of a cooperative activity. COCOA stands for Coordinated Cooperation Agendas.…”
Section: Organizing the Work Process: The Cocoa Coordination Modelmentioning
confidence: 99%
See 2 more Smart Citations
“…The COCOA coordination model [FEdB96,FEdBA97,FEdB98], developed at the University of Twente, offers a rich set of primitives to describe the organizational structure of a cooperative activity. COCOA stands for Coordinated Cooperation Agendas.…”
Section: Organizing the Work Process: The Cocoa Coordination Modelmentioning
confidence: 99%
“…With regard to single workspaces the application designer can specify a set of execution order rules [FEdB96,FEdBA97,FEdB98]. These rules pose workflow-like restrictions on the order and existence of operations in a workspace history.…”
Section: Constraints On Single Workpacesmentioning
confidence: 99%
See 1 more Smart Citation
“…In path expressions, for example, the parallel iteration operator must not contain other parallel iterations, while operands of a parallel composition in synchronization expressions must have disjoint alphabets. regular expressions CoCoA execution rules [9] path expressions [2] synchronization expressions [10] ev ent and flow expressions [22,23] ?? ?…”
Section: Extended Regular Expression Formalismsmentioning
confidence: 99%
“…8, two interaction expressions x 1 and x 2 are considered equal or equivalent, if they possess the same alphabet and accept the same complete and partial words. 9 Given this equivalence relation, numerous useful properties of interaction expressions, like commutativity, associativity, or idempotence of operators, which are intuitively evident, can be formally proven [12].…”
Section: Properties Of Interaction Expressionsmentioning
confidence: 99%