Verification of(≠,=)Constrained Workflow Robustness Based on Satisfiability Counting

ZHAI Zhi-nian, WANG Gang, ZHENG Zhi-jun, PENG Yan-bing, PAN Zhi-gang, WANG Zhong-peng

Acta Electronica Sinica ›› 2015, Vol. 43 ›› Issue (11) : 2298-2304.

PDF(828 KB)
CIE Homepage  |  Join CIE  |  Login CIE  |  中文 
PDF(828 KB)
Acta Electronica Sinica ›› 2015, Vol. 43 ›› Issue (11) : 2298-2304. DOI: 10.3969/j.issn.0372-2112.2015.11.024

Verification of(≠,=)Constrained Workflow Robustness Based on Satisfiability Counting

    {{javascript:window.custom_author_en_index=0;}}
  • {{article.zuoZhe_EN}}
Author information +

HeighLight

{{article.keyPoints_en}}

Abstract

{{article.zhaiyao_en}}

Key words

QR code of this article

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations
{{article.zuoZheEn_L}}. {{article.title_en}}[J]. {{journal.qiKanMingCheng_EN}}, 2015, 43(11): 2298-2304 https://doi.org/10.3969/j.issn.0372-2112.2015.11.024

References

Publishing order | Descend order by publishing year | Descend order by cited within

References

{{article.reference}}

Funding

RIGHTS & PERMISSIONS

{{article.copyrightStatement_en}}
{{article.copyrightLicense_en}}
PDF(828 KB)

Accesses

Citation

Detail
Sections
Recommended
Copyright © Acta Electronica Sinica, All Rights Reserved.
Tel: 010-68600735　
E-mail：new@ejournal.org.cn
Powered by Beijing Magtech Co. Ltd,.
Copyright © Acta Electronica Sinica, All Rights Reserved.

/

〈 〉