本論文提出了一種針將可標記的方塊圖模型對應到候選實作元作（統稱為comps）的高效演算法。我們的方塊圖是一種創新的整合式模型，從高層系統架構到低層原理圖的各種設計皆能表示，特別適用於使用商用零件（COTS）進行電路板設計和基於小晶片組合的積體電路設計。一般方塊圖只是圖形，但在我們的方法論中，對圖形的部分進行標記，包括方塊、埠、連接和插槽，賦予它們含義，以允許候選的comps從元件庫裡被搜尋到。本論文提出了兩種查詢候選實作的方法：第一種基於標記集，而第二種支持對comps的內部結構進行精確匹配和所有權匹配。我們的算法以排序操作來避免複雜度爆炸，同時允許表達豐富的查詢。實驗結果顯示，我們提出的方法和算法能夠支持對設計空間進行高效、精確的探索，這讓設計師來說，原本是繁重或不切實際的手動操作，透過我們的工具已成為可行又容易的任務。

This thesis proposes efficient algorithms for matching candidate implementations (collectively called comps) for board-level designs modeled as taggable block diagrams. Such a model is a novel unified representation for high-level system architectures to low-level schematics alike, and it is particularly suited for board-level design using commercial off-the-shelf (COTS) components and for chiplet-based design of integrated circuits. A block diagram is just a drawing, but in our methodology, tagging parts of a diagram, including blocks, ports, links, and slots, assigns meaning to them and allows candidate comps to be found. This thesis proposes two ways of querying candidates: the first is based on the tag set, while the second supports exact match and ownership match of internal structures of the comps. Our algorithms avoid complexity explosion by efficient ordering of the operations while allowing expressive queries. Experimental results show that our proposed methodology with the proposed algorithms can support efficient, precise exploration of the design space, which would otherwise be overwhelming or impractical for the designers to carry out manually.

Contents
Contents i
Acknowledgments vii
1 Introduction 1
1.1 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Sysmaker . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.3 Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.4 Thesis Organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2 Background and Related Work 4
2.1 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
2.1.1 Ontology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
2.1.2 Component Ontology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
2.1.3 Protégé . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
2.2 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
2.2.1 System Modeling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
2.2.2 Interface Characterization . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
2.2.3 Component Selection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
3 Methodology 8
3.1 System Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
3.2 Terminology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
3.2.1 Block Graph and Tag . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
3.2.2 Candidates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
3.2.3 Component Library . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
3.3 Conventions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
4 Preliminaries 14
4.1 Basic Concepts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
4.2 Candidate-Related Concept . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
5 Problem Statement 19
5.1 Maximal-Candidate-Graph Problem . . . . . . . . . . . . . . . . . . . . . . . . . . 19
5.2 Input and Output . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
6 Elimination Algorithm 23
6.1 Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
6.2 Proof of Correctness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
6.3 Maximality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
6.4 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
7 Algorithm Extensions 28
7.1 Tag Filtering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
7.1.1 Ontology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
7.1.2 Filtering With Reasoning . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
7.1.3 Tag Expression . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
7.2 Structural Match . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
7.2.1 Ownership Match . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
7.2.2 Template Match . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
7.2.3 Exact Match . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
7.3 Compatibility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33
7.4 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34
8 Implementations 36
8.1 System Architecture . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36
8.1.1 Converting Tag Expression to SPARQL Query . . . . . . . . . . . . . . . . 39
8.1.2 Converting Implementation Unit to SPARQL Query . . . . . . . . . . . . . 41
8.2 Elimination Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43
8.3 Component Library . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45
8.3.1 Tag-Knowledge Database . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45
8.3.2 Compeditor . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45
9 Evaluation 48
9.1 Summary of Our Component Library . . . . . . . . . . . . . . . . . . . . . . . . . 48
9.2 Experiment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48
9.2.1 Experimental Setup . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51
9.2.2 Result . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51
9.3 Case Study . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51
10 Conclusions and Future Work 54
10.1 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54
10.2 Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54

[BL13] Lorenz Bühmann and Jens Lehmann. OWL class expression to SPARQL rewriting. Universität Leipzig, Institut für Informatik, AKSW, 2013.
[BSG+07] Arnold Cari R. Bryant, Robert B. Stone, James L. Greer, Daniel A. McAdams, Tolga Kurtoglu, and Matthiew I. Campbell. A function-based component ontology for systems design. Guidelines for a Decision Support Method Adapted to NPD Processes, 2007.
[EJL+03] Johan Eker, Jorn W Janneck, Edward A. Lee, Jie Liu, Xiaojun Liu, Jozsef Ludvig, Sonia Sachs, Yuhong Xiong, and Stephen Neuendorffer. Taming heterogeneity - the ptolemy approach. Proceedings of the IEEE, 91(1):127–144, 2003.
[KFNM04] Holger Knublauch, Ray W. Fergerson, Natalya F. Noy, and Mark A. Musen. The protégé owl plugin: An open development environment for semantic web applications. In Sheila A. McIlraith, Dimitris Plexousakis, and Frank van Harmelen, editors, The Semantic Web – ISWC 2004, pages 229–243, Berlin, Heidelberg, 2004. Springer Berlin Heidelberg.
[Lin37] Caroli Linnaei. Determinationes in hortum siccum joachimi burseri: the text of the manuscript in the linnaean collections, ed. Spencer Savage, London, England, Printed for the Linnaean Society by Taylor and Francis, 1937.
[LRC+20] Richard Lin, Rohit Ramesh, Connie Chi, Nikhil Jain, Ryan Nuqui, Prabal Dutta, and Björn Hartmann. Polymorphic Blocks: Unifying high-level specification and low-level control for circuit board design. In Proceedings of the 33rd Annual ACM Symposium on User Interface Software and Technology, UIST ’20, page 529–540, New York, NY, USA, 2020. Association for Computing Machinery.
[NM01] N. Noy and Deborah McGuinness. Ontology development 101: A guide to creating your first ontology. Knowledge Systems Laboratory, 32, 01 2001.
[Ont] Ontotext USA, Inc. Ontotext GraphDB documentation. https://graphdb.ontotext.com/ documentation/10.2/. Accessed: 2023-07-01.
[OSV] Steve Oney, Erik Smekkie, and Lea Verou. jsep: A tiny JavaScript expression parser. https://www.npmjs.com/package/jsep. Version: 1.3.8.
[PH] Terence Parr and Sam Harwell. ANTLR: ANother Tool for Language Recognition. https://www.antlr.org. Version: 4.
[RLI+17] Rohit Ramesh, Richard Lin, Antonio Iannopollo, Alberto Sangiovanni-Vincentelli, Björn Hartmann, and Prabal Dutta. Turning coders into makers: The promise of embedded design generation. In Proceedings of the 1st Annual ACM Symposium on Computational Fabrication, SCF ’17, New York, NY, USA, 2017. Association for Computing Machinery.
[SLZG13] Xiaoyu Song, Xi Lin, Hehua Zhang, and Ming Gu. OntCheck: An ontology-driven static correctness checking tool for component-based models. Journal of Applied Mathematics, 2013:934349, 2013.