Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-642-24559-6_9
DC FieldValue
dc.titleVerification of orchestration systems using compositional partial order reduction
dc.contributor.authorTan, T.H.
dc.contributor.authorLiu, Y.
dc.contributor.authorSun, J.
dc.contributor.authorDong, J.S.
dc.date.accessioned2013-07-23T09:26:59Z
dc.date.available2013-07-23T09:26:59Z
dc.date.issued2011
dc.identifier.citationTan, T.H.,Liu, Y.,Sun, J.,Dong, J.S. (2011). Verification of orchestration systems using compositional partial order reduction. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6991 LNCS : 98-114. ScholarBank@NUS Repository. <a href="https://doi.org/10.1007/978-3-642-24559-6_9" target="_blank">https://doi.org/10.1007/978-3-642-24559-6_9</a>
dc.identifier.isbn9783642245589
dc.identifier.issn03029743
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/43174
dc.description.abstractOrc is a computation orchestration language which is designed to specify computational services, such as distributed communication and data manipulation, in a concise and elegant way. Four concurrency primitives allow programmers to orchestrate site calls to achieve a goal, while managing timeouts, priorities, and failures. To guarantee the correctness of Orc model, effective verification support is desirable. Orc has a highly concurrent semantics which introduces the problem of state-explosion to search-based verification methods like model checking. In this paper, we present a new method, called Compositional Partial Order Reduction (CPOR), which aims to provide greater state-space reduction than classic partial order reduction methods in the context of hierarchical concurrent processes. Evaluation shows that CPOR is more effective in reducing the state space than classic partial order reduction methods. © 2011 Springer-Verlag.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/978-3-642-24559-6_9
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.contributor.departmentTEMASEK LABORATORIES
dc.description.doi10.1007/978-3-642-24559-6_9
dc.description.sourcetitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.description.volume6991 LNCS
dc.description.page98-114
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

4
checked on May 15, 2019

Page view(s)

79
checked on May 17, 2019

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.