2010
DOI: 10.1007/978-3-642-12035-0_6
|View full text |Cite
|
Sign up to set email alerts
|

A Web Service Similarity Refinement Framework Using Automata Comparison

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…Our problem also has some similarity to the problem of measuring the similarity of two deterministic finite automata, as considered by Schwefel, Wegener, and Weinert [4], who solved it using evolutionary algorithms. Chen and Chow also used a scheme for comparing automata, specifically in the context of web services [14]. Our work is differs because of the unique challenges inherent in the differences between filters and automata-because the behavior of a filter may be undefined for certain state-action pairs, the problem of measuring similarities between filters is more challenging.…”
Section: Filter Reductionmentioning
confidence: 99%

Improper Filter Reduction

Saberifar,
Mohades,
Razzazi
et al. 2017
Preprint
“…Our problem also has some similarity to the problem of measuring the similarity of two deterministic finite automata, as considered by Schwefel, Wegener, and Weinert [4], who solved it using evolutionary algorithms. Chen and Chow also used a scheme for comparing automata, specifically in the context of web services [14]. Our work is differs because of the unique challenges inherent in the differences between filters and automata-because the behavior of a filter may be undefined for certain state-action pairs, the problem of measuring similarities between filters is more challenging.…”
Section: Filter Reductionmentioning
confidence: 99%

Improper Filter Reduction

Saberifar,
Mohades,
Razzazi
et al. 2017
Preprint