Relevant bibliographies by topics / SADT bond graph

Contents

  1. Journal articles
  2. Book chapters
  3. Conference papers

Academic literature on the topic 'SADT bond graph'

Author: Grafiati
Published: 4 June 2025
Last updated: 1 August 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'SADT bond graph.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "SADT bond graph"

1

Salem J, Ben, Lakhoua M.N., and El Amraoui L. "Modeling of Dynamical System Piloted by Discrete Subsystem Based on Bond Graph Approach." International Journal of Electrical and Computer Engineering (IJECE) 7, no. 5 (2017): 2902. http://dx.doi.org/10.11591/ijece.v7i5.pp2902-2910.

Full text
Abstract:
This paper is a contribution to the analysis and modeling of a mechatronic system with dynamic behavior that is controlled by a digital computer. In this paper, a bibliographic research on mechatronic systems is presented by specifying a case study of the Anti-lock Braking System (ABS). Then, a methodology of systemic modeling of the ABS system based on two methods Structured Analysis Design Technique (SADT) and bond graph (BG) is proposed. The model created is validated with three software programs: CarSim, 20 Sim and Simulink.
APA, Harvard, Vancouver, ISO, and other styles
2

Ben, Salem J., M. N. Lakhoua, and Amraoui L. El. "Modeling of Dynamical System Piloted by Discrete Subsystem Based on Bond Graph Approach." International Journal of Electrical and Computer Engineering (IJECE) 7, no. 5 (2017): 2902–10. https://doi.org/10.11591/ijece.v7i5.pp2902-2910.

Full text
Abstract:
This paper is a contribution to the analysis and modeling of a mechatronic system with dynamic behavior that is controlled by a digital computer. In this paper, a bibliographic research on mechatronic systems is presented by specifying a case study of the Anti-lock Braking System (ABS). Then, a methodology of systemic modeling of the ABS system based on two methods Structured Analysis Design Technique (SADT) and bond graph (BG) is proposed. The model created is validated with three software programs: CarSim, 20 Sim and Simulink.
APA, Harvard, Vancouver, ISO, and other styles
3

Wertani, Hamza, Jamel Ben Salem, and Mohamed Najeh Lakhoua. "Contribution to the systemic modeling of a photovoltaic devices." Independent Journal of Management & Production 12, no. 8 (2021): 2343–63. http://dx.doi.org/10.14807/ijmp.v12i8.1544.

Full text
Abstract:
The modelling of systems using systemic tools has been for a few years, a subject which has attracted the attention of scientists and especially researchers to allow designers to acquire a rigorous approach to problem solving using the capabilities of already existing methods and tools. This document presents a contribution in the field of modelling, where a methodology based on two methods has been proposed. The first concerns the functional analysis to extract the use functions and the constraint parameters from the system. In this methodology, the static functional study is carried out usin
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "SADT bond graph"

1

Fang Zhiwen, Li Chu-Min, Qiao Kan, Feng Xu, and Xu Ke. "Solving Maximum Weight Clique Using Maximum Satisfiability Reasoning." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2014. https://doi.org/10.3233/978-1-61499-419-0-303.

Full text
Abstract:
Satisfiability (SAT) and maximum satisfiability (MaxSAT) techniques are proved to be powerful in solving combinatorial optimization problems. In this paper, we encode the maximum weight clique (MWC) problem into weighted partial MaxSAT and use MaxSAT techniques to solve it. Concretely, we propose a new algorithm based on MaxSAT reasoning called Top-k failed literal detection to improve the upper bound for MWC, and implement an exact branch-and-bound solver for the MWC problem called MaxWClq based on the Top-k failed literal detection algorithm. To our best knowledge, this is the first time tha
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "SADT bond graph"

1

Hebrard, Emmanuel, and George Katsirelos. "Clause Learning and New Bounds for Graph Coloring." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/856.

Full text
Abstract:
Graph coloring is a major component of numerous allocation and scheduling problems. We introduce a hybrid CP/SAT approach to graph coloring based on exploring Zykov’s tree: for two non-neighbors, either they take a different color and there might as well be an edge between them, or they take the same color and we might as well merge them. Branching on whether two neighbors get the same color yields a symmetry-free tree with complete graphs as leaves, which correspond to colorings of the original graph. We introduce a new lower bound for this problem based on Mycielskian graphs; a method to pro
APA, Harvard, Vancouver, ISO, and other styles
2

Schidler, André, and Stefan Szeider. "Computing Twin-width with SAT and Branch & Bound." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/224.

Full text
Abstract:
The graph width-measure twin-width recently attracted great attention because of its solving power and generality. Many prominent NP-hard problems are tractable on graphs of bounded twin-width if a certificate for the twin-width bound is provided as an input. Bounded twin-width subsumes other prominent structural restrictions such as bounded treewidth and bounded rank-width. Computing such a certificate is NP-hard itself, already for twin-width 4, and the only known implemented algorithm for twin-width computation is based on a SAT encoding. In this paper, we propose two new algorithmic approa
APA, Harvard, Vancouver, ISO, and other styles
3

Kirchweger, Markus, Tomáš Peitl, and Stefan Szeider. "Co-Certificate Learning with SAT Modulo Symmetries." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/216.

Full text
Abstract:
We present a new SAT-based method for generating all graphs up to isomorphism that satisfy a given co-NP property. Our method extends the SAT Modulo Symmetry (SMS) framework with a technique that we call co-certificate learning. If SMS generates a candidate graph that violates the given co-NP property, we obtain a certificate for this violation, i.e., `co-certificate' for the co-NP property. The co-certificate gives rise to a clause that the SAT solver, serving as SMS's backend, learns as part of its CDCL procedure. We demonstrate that SMS plus co-certificate learning is a powerful method that
APA, Harvard, Vancouver, ISO, and other styles
4

Huang, Pei, Minghao Liu, Ping Wang, Wenhui Zhang, Feifei Ma, and Jian Zhang. "Solving the Satisfiability Problem of Modal Logic S5 Guided by Graph Coloring." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/153.

Full text
Abstract:
Modal logic S5 has found various applications in artificial intelligence. With the advances in modern SAT solvers, SAT-based approach has shown great potential in solving the satisfiability problem of S5. The scale of the SAT encoding for S5 is strongly influenced by the upper bound on the number of possible worlds. In this paper, we present a novel SAT-based approach for S5 satisfiability problem. We show a normal form for S5 formulas. Based on this normal form, a conflict graph can be derived whose chromatic number provides an upper bound of the possible worlds and a lot of unnecessary searc
APA, Harvard, Vancouver, ISO, and other styles
5

Hebrard, Emmanuel, and George Katsirelos. "Conflict Directed Clause Learning for Maximum Weighted Clique Problem." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/183.

Full text
Abstract:
The maximum clique and minimum vertex cover problems are among Karp's 21 NP-complete problems, and have numerous applications: in combinatorial auctions, for computing phylogenetic trees, to predict the structure of proteins, to analyse social networks, and so forth. Currently, the best complete methods are branch & bound algorithms and rely largely on graph colouring to compute a bound. We introduce a new approach based on SAT and on the "Conflict-Driven Clause Learning" (CDCL) algorithm. We propose an efficient implementation of Babel's bound and pruning rule, as well as a novel dominanc
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography