Complexity of synthesis of composite service with correctness guarantee
How to compose existing web services automatically and to guarantee the correctness of the design （e.g. temporal constraints specified by temporal logic LTL, CTL or CTL＊） is an important and challenging problem in web services. Most existing approaches use the process in conventional software develo...
Gespeichert in:
| Veröffentlicht in: | Science China. Information sciences 2012-03, Vol.55 (3), p.638-649 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 649 |
|---|---|
| container_issue | 3 |
| container_start_page | 638 |
| container_title | Science China. Information sciences |
| container_volume | 55 |
| creator | Deng, Ting Huai, JinPeng Wo, TianYu |
| description | How to compose existing web services automatically and to guarantee the correctness of the design （e.g. temporal constraints specified by temporal logic LTL, CTL or CTL＊） is an important and challenging problem in web services. Most existing approaches use the process in conventional software development of design, verification, analysis and correction to guarantee the correctness of composite services, which makes the composition process both complex and time-consuming. In this paper, we focus on the synthesis problem of composite service; that is, for a given set of services and correctness constraint specified by CTL or CWL＊ formula, a composite service is automatically constructed which guarantees that the correctness is ensured. We prove that the synthesis problem for CTL and CTL＊ are complete for EXPTIME and 2EXPTIME, respectively. Moreover, for the case of synthesis failure, we discuss the problem of how to disable outputs of environment （i.e. users or services） reasonably to make synthesis successful, which are also proved complete for EXPTIME and 2EXPTIME for CTL and CTL＊, respectively. |
| doi_str_mv | 10.1007/s11432-011-4460-z |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1031296949</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>40952343</cqvip_id><sourcerecordid>1031296949</sourcerecordid><originalsourceid>FETCH-LOGICAL-c327t-7414ad9593eb48f650ba9ff69634fe3af06fdf38d3d31dac6446e1a132752a293</originalsourceid><addsrcrecordid>eNp9kD9PwzAQxS0EElXpB2ALYmEJ-F-ceEQVFKRKLCCxWW5yblOlSetLgPbT4ygVSAx4sc_-vXfnR8glo7eM0vQOGZOCx5SxWEpF48MJGbFM6Zhppk_DWaUyToV4PycTxDUNSwjK02xEZtNms63gq2z3UeMi3NftCrDEvsjDU4NlCxGC_yhziD7LdhWuvYe8rQExWnbW27oFuCBnzlYIk-M-Jm-PD6_Tp3j-Mnue3s_jXPC0jVPJpC10ogUsZOZUQhdWO6e0EtKBsI4qVziRFaIQrLC5Cv8BZlkQJ9xyLcbkZvDd-mbXAbZmU2IOVWVraDo0jArGtdKyR6__oOum83WYznAd4qGplCJQbKBy3yB6cGbry431-2Bl-nTNkK4J6Zo-XXMIGj5oMLD1Evyv83-iq2OjVVMvd0H300lSnXARhvkGpfyITA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918607443</pqid></control><display><type>article</type><title>Complexity of synthesis of composite service with correctness guarantee</title><source>SpringerLink (Online service)</source><source>ProQuest Central UK/Ireland</source><source>Alma/SFX Local Collection</source><source>ProQuest Central</source><creator>Deng, Ting ; Huai, JinPeng ; Wo, TianYu</creator><creatorcontrib>Deng, Ting ; Huai, JinPeng ; Wo, TianYu</creatorcontrib><description>How to compose existing web services automatically and to guarantee the correctness of the design （e.g. temporal constraints specified by temporal logic LTL, CTL or CTL＊） is an important and challenging problem in web services. Most existing approaches use the process in conventional software development of design, verification, analysis and correction to guarantee the correctness of composite services, which makes the composition process both complex and time-consuming. In this paper, we focus on the synthesis problem of composite service; that is, for a given set of services and correctness constraint specified by CTL or CWL＊ formula, a composite service is automatically constructed which guarantees that the correctness is ensured. We prove that the synthesis problem for CTL and CTL＊ are complete for EXPTIME and 2EXPTIME, respectively. Moreover, for the case of synthesis failure, we discuss the problem of how to disable outputs of environment （i.e. users or services） reasonably to make synthesis successful, which are also proved complete for EXPTIME and 2EXPTIME for CTL and CTL＊, respectively.</description><identifier>ISSN: 1674-733X</identifier><identifier>EISSN: 1869-1919</identifier><identifier>DOI: 10.1007/s11432-011-4460-z</identifier><language>eng</language><publisher>Heidelberg: SP Science China Press</publisher><subject>China ; Complexity ; Computer Science ; Construction specifications ; CTL ; Design engineering ; Guarantees ; Information Systems and Communication Service ; Program verification (computers) ; Research Paper ; Software development ; Synthesis ; Temporal logic ; Web services ; Web服务 ; 合成 ; 复合 ; 复杂性 ; 时序逻辑 ; 煤制油 ; 软件开发</subject><ispartof>Science China. Information sciences, 2012-03, Vol.55 (3), p.638-649</ispartof><rights>Science China Press and Springer-Verlag Berlin Heidelberg 2012</rights><rights>Science China Press and Springer-Verlag Berlin Heidelberg 2012.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c327t-7414ad9593eb48f650ba9ff69634fe3af06fdf38d3d31dac6446e1a132752a293</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/84009A/84009A.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11432-011-4460-z$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2918607443?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,21388,27924,27925,33744,33745,41488,42557,43805,51319,64385,64387,64389,72469</link.rule.ids></links><search><creatorcontrib>Deng, Ting</creatorcontrib><creatorcontrib>Huai, JinPeng</creatorcontrib><creatorcontrib>Wo, TianYu</creatorcontrib><title>Complexity of synthesis of composite service with correctness guarantee</title><title>Science China. Information sciences</title><addtitle>Sci. China Inf. Sci</addtitle><addtitle>SCIENCE CHINA Information Sciences</addtitle><description>How to compose existing web services automatically and to guarantee the correctness of the design （e.g. temporal constraints specified by temporal logic LTL, CTL or CTL＊） is an important and challenging problem in web services. Most existing approaches use the process in conventional software development of design, verification, analysis and correction to guarantee the correctness of composite services, which makes the composition process both complex and time-consuming. In this paper, we focus on the synthesis problem of composite service; that is, for a given set of services and correctness constraint specified by CTL or CWL＊ formula, a composite service is automatically constructed which guarantees that the correctness is ensured. We prove that the synthesis problem for CTL and CTL＊ are complete for EXPTIME and 2EXPTIME, respectively. Moreover, for the case of synthesis failure, we discuss the problem of how to disable outputs of environment （i.e. users or services） reasonably to make synthesis successful, which are also proved complete for EXPTIME and 2EXPTIME for CTL and CTL＊, respectively.</description><subject>China</subject><subject>Complexity</subject><subject>Computer Science</subject><subject>Construction specifications</subject><subject>CTL</subject><subject>Design engineering</subject><subject>Guarantees</subject><subject>Information Systems and Communication Service</subject><subject>Program verification (computers)</subject><subject>Research Paper</subject><subject>Software development</subject><subject>Synthesis</subject><subject>Temporal logic</subject><subject>Web services</subject><subject>Web服务</subject><subject>合成</subject><subject>复合</subject><subject>复杂性</subject><subject>时序逻辑</subject><subject>煤制油</subject><subject>软件开发</subject><issn>1674-733X</issn><issn>1869-1919</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp9kD9PwzAQxS0EElXpB2ALYmEJ-F-ceEQVFKRKLCCxWW5yblOlSetLgPbT4ygVSAx4sc_-vXfnR8glo7eM0vQOGZOCx5SxWEpF48MJGbFM6Zhppk_DWaUyToV4PycTxDUNSwjK02xEZtNms63gq2z3UeMi3NftCrDEvsjDU4NlCxGC_yhziD7LdhWuvYe8rQExWnbW27oFuCBnzlYIk-M-Jm-PD6_Tp3j-Mnue3s_jXPC0jVPJpC10ogUsZOZUQhdWO6e0EtKBsI4qVziRFaIQrLC5Cv8BZlkQJ9xyLcbkZvDd-mbXAbZmU2IOVWVraDo0jArGtdKyR6__oOum83WYznAd4qGplCJQbKBy3yB6cGbry431-2Bl-nTNkK4J6Zo-XXMIGj5oMLD1Evyv83-iq2OjVVMvd0H300lSnXARhvkGpfyITA</recordid><startdate>20120301</startdate><enddate>20120301</enddate><creator>Deng, Ting</creator><creator>Huai, JinPeng</creator><creator>Wo, TianYu</creator><general>SP Science China Press</general><general>Springer Nature B.V</general><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>W92</scope><scope>~WA</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>7SC</scope><scope>8FD</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20120301</creationdate><title>Complexity of synthesis of composite service with correctness guarantee</title><author>Deng, Ting ; Huai, JinPeng ; Wo, TianYu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c327t-7414ad9593eb48f650ba9ff69634fe3af06fdf38d3d31dac6446e1a132752a293</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>China</topic><topic>Complexity</topic><topic>Computer Science</topic><topic>Construction specifications</topic><topic>CTL</topic><topic>Design engineering</topic><topic>Guarantees</topic><topic>Information Systems and Communication Service</topic><topic>Program verification (computers)</topic><topic>Research Paper</topic><topic>Software development</topic><topic>Synthesis</topic><topic>Temporal logic</topic><topic>Web services</topic><topic>Web服务</topic><topic>合成</topic><topic>复合</topic><topic>复杂性</topic><topic>时序逻辑</topic><topic>煤制油</topic><topic>软件开发</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Deng, Ting</creatorcontrib><creatorcontrib>Huai, JinPeng</creatorcontrib><creatorcontrib>Wo, TianYu</creatorcontrib><collection>维普_期刊</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>维普中文期刊数据库</collection><collection>中文科技期刊数据库-工程技术</collection><collection>中文科技期刊数据库- 镜像站点</collection><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer science database</collection><collection>ProQuest advanced technologies & aerospace journals</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Science China. Information sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Deng, Ting</au><au>Huai, JinPeng</au><au>Wo, TianYu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Complexity of synthesis of composite service with correctness guarantee</atitle><jtitle>Science China. Information sciences</jtitle><stitle>Sci. China Inf. Sci</stitle><addtitle>SCIENCE CHINA Information Sciences</addtitle><date>2012-03-01</date><risdate>2012</risdate><volume>55</volume><issue>3</issue><spage>638</spage><epage>649</epage><pages>638-649</pages><issn>1674-733X</issn><eissn>1869-1919</eissn><abstract>How to compose existing web services automatically and to guarantee the correctness of the design （e.g. temporal constraints specified by temporal logic LTL, CTL or CTL＊） is an important and challenging problem in web services. Most existing approaches use the process in conventional software development of design, verification, analysis and correction to guarantee the correctness of composite services, which makes the composition process both complex and time-consuming. In this paper, we focus on the synthesis problem of composite service; that is, for a given set of services and correctness constraint specified by CTL or CWL＊ formula, a composite service is automatically constructed which guarantees that the correctness is ensured. We prove that the synthesis problem for CTL and CTL＊ are complete for EXPTIME and 2EXPTIME, respectively. Moreover, for the case of synthesis failure, we discuss the problem of how to disable outputs of environment （i.e. users or services） reasonably to make synthesis successful, which are also proved complete for EXPTIME and 2EXPTIME for CTL and CTL＊, respectively.</abstract><cop>Heidelberg</cop><pub>SP Science China Press</pub><doi>10.1007/s11432-011-4460-z</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1674-733X |
| ispartof | Science China. Information sciences, 2012-03, Vol.55 (3), p.638-649 |
| issn | 1674-733X 1869-1919 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1031296949 |
| source | SpringerLink (Online service); ProQuest Central UK/Ireland; Alma/SFX Local Collection; ProQuest Central |
| subjects | China Complexity Computer Science Construction specifications CTL Design engineering Guarantees Information Systems and Communication Service Program verification (computers) Research Paper Software development Synthesis Temporal logic Web services Web服务 合成 复合 复杂性 时序逻辑 煤制油 软件开发 |
| title | Complexity of synthesis of composite service with correctness guarantee |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T05%3A03%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Complexity%20of%20synthesis%20of%20composite%20service%20with%20correctness%20guarantee&rft.jtitle=Science%20China.%20Information%20sciences&rft.au=Deng,%20Ting&rft.date=2012-03-01&rft.volume=55&rft.issue=3&rft.spage=638&rft.epage=649&rft.pages=638-649&rft.issn=1674-733X&rft.eissn=1869-1919&rft_id=info:doi/10.1007/s11432-011-4460-z&rft_dat=%3Cproquest_cross%3E1031296949%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2918607443&rft_id=info:pmid/&rft_cqvip_id=40952343&rfr_iscdi=true |