Hardness and inapproximability of minimizing adaptive distinguishing sequences
Author:
Publisher
Springer Science and Business Media LLC
Subject
Hardware and Architecture,Theoretical Computer Science,Software
Link
http://link.springer.com/content/pdf/10.1007/s10703-014-0205-0.pdf
Reference61 articles.
1. Adelson-Velskii G, Landis E (1962) An algorithm for the organization of information. In: Doklady Akademii Nauk USSR, vol 146, no 2, pp 263–266
2. Adler M, Heeringa B (2008) Approximating optimal binary decision trees. In: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on approximation, randomization and combinatorial optimization: algorithms and techniques, Springer, Berlin, APPROX ’08 / RANDOM ’08, pp 1–9
3. Aho AV, Dahbura AT, Lee D, Uyar MÜ (1991) An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours. IEEE Trans Commun 39(11):1604–1615. doi: 10.1109/26.111442
4. Alur R, Courcoubetis C, Yannakakis M (1995) Distinguishing tests for nondeterministic and probabilistic machines. In: Leighton FT, Borodin A (eds) Proceedings of the twenty-seventh annual ACM symposium on theory of computing. ACM, Las Vegas, Nevada, USA, STOC’95, pp 363–372, 29 May–1 June 1995. doi: 10.1145/225058.225161
5. Betin-Can A, Bultan T (2004) Verifiable concurrent programming using concurrency controllers. In: Proceedings of the 19th IEEE international conference on automated software engineering, IEEE Computer Society, pp 248–257
Cited by 13 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Incomplete Adaptive Distinguishing Sequences for Non-Deterministic FSMs;IEEE Transactions on Software Engineering;2023-09
2. Minimizing Characterizing sets;Science of Computer Programming;2021-08
3. Evaluating the complexity of deriving adaptive $$S'$$-homing and $$S'$$-synchronizing sequences for nondeterministic FSMs;Software Quality Journal;2021-04-13
4. Evaluating the Complexity of Deriving Adaptive Homing, Synchronizing and Distinguishing Sequences for Nondeterministic FSMs;Testing Software and Systems;2019
5. Incremental and Heuristic Approaches for Deriving Adaptive Distinguishing Test Cases for Non-deterministic Finite-State Machines;The Computer Journal;2018-09-19
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3