A New Approach for Compliance Checking in Service Workflows

The emergence of the Internet-of-Things (IoT) refers to not only the ability to identify physical objects, but also to identify many types of virtual objects, including services. Such identification plays a crucial role in service workflow. The success of a service workflow requires the composition...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on industrial informatics 2014-05, Vol.10 (2), p.1452-1460
Main Authors: Viriyasitavat, Wattana, Li Da Xu, Viriyasitavat, Wantanee
Format: Article
Language:English
Subjects:
Algorithm
Algorithm design and analysis
Algorithms
Collaboration
compliance checking
Cost engineering
Grammar
Informatics
Internet
Internet-of-Things (IoT)
Polynomials
Representations
service
specification language
Specification languages
Specifications
Tables (data)
Time complexity
Workflow
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The emergence of the Internet-of-Things (IoT) refers to not only the ability to identify physical objects, but also to identify many types of virtual objects, including services. Such identification plays a crucial role in service workflow. The success of a service workflow requires the composition of services where requirements must be satisfied. However, the large-scale open environment of today's Internet poses significant challenges for efficient compliance checking algorithms of those requirements. This paper is based on the previous progressive work on Service Workflow Specification language (SWSpec), the uniformed representation of requirements, and the compliance checking algorithms based on Constrained Truth Table (CTT) and Exclusive Disjunctive Normal Form (EDNF). In this paper, a new algorithm is proposed, which significantly reduces the cost of time complexity. In some cases, this algorithm is able to run in polynomial time. Experiments are conducted to evaluate and compare the performance of these algorithms.
ISSN:1551-3203
1941-0050
DOI:10.1109/TII.2014.2301143