A grammar-based index for matching business processes

Mahleko, Bendick; Wombacher, Andreas; Fankhauser, Péter

doi:10.1109/icws.2005.6

Cited by 18 publications

(15 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For example in the reference automaton in Fig 1 the target state of transition with label r is represented as a 2-gram by ir, and as a 4-gram by pp ir. Details on how to construct ngrams can be found in [34].…”

Section: Workflow State Set Based Similarity Measurementioning

confidence: 99%

“…The distance of automata can be calculated based on their language representation as long as the languages and words are finite. Since infinite strings are constructed from a finite automaton, in [34] it has been proposed to represent an automaton based on its finite set of states. States are represented as n-grams 2 , i.e., a sequence of n transition labels ending in the state.…”

Section: Workflow State Set Based Similarity Measurementioning

confidence: 99%

See 1 more Smart Citation

Alternative Approaches for Workflow Similarity

Wombacher

2010

2010 IEEE International Conference on Services Computing

View full text Add to dashboard Cite

Abstract-Service discovery of state dependent services has to take workflow aspects into account. To increase the usability of a service discovery, the result list of services should be ordered with regard to the relevance of the services. Means of ordering a list of workflows is a similarity measure of the workflow and a query. In this paper different similarity measures facilitating structured workflows and higher level change operations are presented and evaluated based on a pilot of an empirical study. In particular the different measures are compared with the study results. It turns out that the quality of the different measures differ significantly. The best results can be achieved by facilitating n-gram multisets as a workflow as a basis for the similarity measure calculations.

show abstract

Section: Workflow State Set Based Similarity Measurementioning

confidence: 99%

Section: Workflow State Set Based Similarity Measurementioning

confidence: 99%

Alternative Approaches for Workflow Similarity

Wombacher

2010

2010 IEEE International Conference on Services Computing

View full text Add to dashboard Cite

show abstract

“…A. Wombacher proposes an approach based on an extended finite state automata for service matchmaking [11] [12][13] [14]. Furthermore, [15] proposes a new behavior model for Web services by using automata and logic formalisms.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

An Approach for Specifying Capability ofWeb Services based on Environment Ontology

Wang

Jin

Liu

2006

2006 IEEE International Conference on Web Services (ICWS'06)

View full text Add to dashboard Cite

Capability specification is key problem for Web service discovery. Conventional one-step process based capability specification has its limitations. This paper proposes an approach for semantic behavior-based capability specification of Web service to stride over the limitations. Meta-level environment ontology is proposed to provide formal and sharable specifications of environment resources in a particular domain. For each environment resource, there is a corresponding hierarchical state machine specifying its dynamic characteristics. Then, effects on the environment resources are modelled with the hierarchical state machines. On the basis of the environment ontology, forest-structured communicating hierarchical state machines (FCHM) are defined and expected to be semantics of capability specification of Web services, which can be derived from the effects that Web services impose on their environments.

show abstract

“…Because CVS is a relatively mature standard model, this experiment compares the operating state diagrams that are generated by different CVS client software. In this experiment, the standard model is constructed by Roth et al [15] through a program of trace results. Besides, this standard model describes the software behavior performed by the CVS client, including basic operations such as software initialization, connection to server, login, modification of version files, and logout and disconnection.…”

Section: Experiments Design and Methodsmentioning

confidence: 99%

Structured Algorithm for Software Behavior Model based on Finite State Automaton

Chen¹,

Zhao²,

Yin³

et al. 2018

dtcse

View full text Add to dashboard Cite

At present, with the rapid development of software, software security is very more and more serious. In order to solve the software security problem, it is necessary to monitor the software behavior. Therefore, this paper studies the differences between the running states of the software, and finds out and quantifies the differences, which further monitors the software behavior in software security. This paper analyzes the topology structure algorithm of software behavior model and proposes FSM Diff algorithm based on finite state automaton. FSM Diff algorithm is more effective to select the key state nodes. Besides, experiment shows that FSM Diff algorithm is effective to select the key state nodes in the software running state diagram.

show abstract

A grammar-based index for matching business processes

Cited by 18 publications

References 12 publications

Alternative Approaches for Workflow Similarity

Alternative Approaches for Workflow Similarity

An Approach for Specifying Capability ofWeb Services based on Environment Ontology

Structured Algorithm for Software Behavior Model based on Finite State Automaton

Contact Info

Product

Resources

About