Proceedings. IEEE International Conference on E-Commerce Technology, 2004. CEC 2004. 2004
DOI: 10.1109/icect.2004.1319727
|View full text |Cite
|
Sign up to set email alerts
|

IPSI-PF: a business process matchmaking engine

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2004
2004
2018
2018

Publication Types

Select...
5
3

Relationship

3
5

Authors

Journals

citations
Cited by 22 publications
(12 citation statements)
references
References 21 publications
0
12
0
Order By: Relevance
“…The paper is motivated based on service composition in Service Oriented Architectures. In particular, the basic operations of the presented approach have been implemented [13] and have been applied in a service discovery implementation [14] based on bilateral consistency. Finally, a protocol has been proposed to determine a potential service composition in a decentralized way resulting in a set of services as a basis for consistency checking [9].…”
Section: Discussionmentioning
confidence: 99%
“…The paper is motivated based on service composition in Service Oriented Architectures. In particular, the basic operations of the presented approach have been implemented [13] and have been applied in a service discovery implementation [14] based on bilateral consistency. Finally, a protocol has been proposed to determine a potential service composition in a decentralized way resulting in a set of services as a basis for consistency checking [9].…”
Section: Discussionmentioning
confidence: 99%
“…Further, a partial mapping from BPEL (private processes) to annotated Finite State Automata (public processes) has been realized [11] and been used for implementing service discovery [13]. The extension of classical UDDI proposed in this context uses BPEL specifications of public processes and bilateral consistency to improve the precision of service discovery results.…”
Section: Implementation Issuesmentioning
confidence: 99%
“…In particular, intersection combines annotation of states by conjunction, while the emptiness test checks reachability of final states not only via a single transition, but via all transitions contained in a conjunction of an annotation. A detailed discussion of the sketched operations and their applicability to matchmaking business processes is given in [19].…”
Section: Formal Modelmentioning
confidence: 99%
“…Thus, several extensions of UDDI have been proposed such as addressing Service Level Agreement [8], semantic [4], or logical [1] extensions of UDDI. An extension of UDDI taking care of internal states (process specification) of a service is discussed in [19].…”
Section: Introductionmentioning
confidence: 99%