Sixth International Conference on Grid and Cooperative Computing (GCC 2007) 2007
DOI: 10.1109/gcc.2007.9
|View full text |Cite
|
Sign up to set email alerts
|

A Framework for Time Consistency Verification for Web Processes Based on Annotated OWL-S

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2010
2010
2013
2013

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(8 citation statements)
references
References 18 publications
0
8
0
Order By: Relevance
“…1 can be marked because of either one of three reasons, namely, the occurrence of a SOAP error (by firing immediate transition soap_f ), the triggering of timeout (by firing timeout), and faults of invoked external services (by firing ivk_f ). P {failed} is therefore calculated as P {failed} =pe(soap_f )+(1−pe(soap_f ))×PTE + (1−pe(soap_f ))×(1−PTE)×pe(ivk_f ) (2) where pe(soap_f ) and pe(ivk_f ) denote the probabilities of firing soap_f and ivk_f , respectively. PTE denotes the probability of triggering timeout.…”
Section: Reliability Evaluationmentioning
confidence: 99%
See 1 more Smart Citation
“…1 can be marked because of either one of three reasons, namely, the occurrence of a SOAP error (by firing immediate transition soap_f ), the triggering of timeout (by firing timeout), and faults of invoked external services (by firing ivk_f ). P {failed} is therefore calculated as P {failed} =pe(soap_f )+(1−pe(soap_f ))×PTE + (1−pe(soap_f ))×(1−PTE)×pe(ivk_f ) (2) where pe(soap_f ) and pe(ivk_f ) denote the probabilities of firing soap_f and ivk_f , respectively. PTE denotes the probability of triggering timeout.…”
Section: Reliability Evaluationmentioning
confidence: 99%
“…Recently, various research contributions have been proposed for the formalization and functional verification of OWL-S. For example, studies based on Petri nets [2]- [4], process algebra [5]- [7], and other formal models [8]- [10] are introduced to capture behavioral patterns of the service ontologies as well as to verify formal and functional properties (e.g., deadlock freeness, boundedness, interface compatibility, and liveness). However, the quantitative and nonfunctional properties of OWL-S processes, particularly the dependability and reliability, have been less studied.…”
Section: Introductionmentioning
confidence: 99%
“…OWL-S is a computer-interpretable semantic mark-up language, where, for the first time, ontology-based descriptions of service functionality and of interaction service behaviour coexist. Recently, various research contributions have been proposed in formalization and functional verification of OWL-S. For example, researches based on Petri nets [2], [3], process algebra [4] and other formal models [5] are introduced to capture the behavioral patterns of the service ontologies and verify formal and functional properties (e.g., deadlockfreeness, boundedness, interface compatibility, and liveness). However, there are still many limitations in the abovementioned models, e.g., the incomplete modelling of the process model, the absence of modelling service grounding, and the absence of modelling timeout in the atomic process, .etc.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, various researches have been performed in formalization and functional analysis of OWL-S. For example, researches based on Petri net [3][4][5][6][7], process algebra [8][9][10][11], and other formal models [12][13][14] are introduced to formally capture behavioral patterns of ontology-based service composition and build upon a large body of theoretical results as well as techniques for verifying formal and functional properties. However, research in nonfunctional properties of ontology-based 2256 Y. XIA ET AL.…”
Section: Introductionmentioning
confidence: 99%