Bibliographies thématiques / Reachability Analysi / Articles de revues

Articles de revues sur le sujet « Reachability Analysi »

Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Reachability Analysi.
Auteur : Grafiati
Publié le 11 mars 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les 50 meilleurs articles de revues pour votre recherche sur le sujet « Reachability Analysi ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Parcourez les articles de revues sur diverses disciplines et organisez correctement votre bibliographie.

1

Gu, Shen Shen. « Scheduling Flexible Manufacturing Systems with Petri Nets Based on the Cell Enumeration Method ». Advanced Materials Research 346 (septembre 2011) : 412–18. http://dx.doi.org/10.4028/www.scientific.net/amr.346.412.

Texte intégral
Résumé :
In the field of modern manufacturing, flexible manufacturing systems (FMS) is very important because it can scheduleand optimize multipurpose machines to produce multiple types of products. When applying the FMS technology, Petri Net is used to model the machines, parts and the whole manufacturing progress. The core concern of FMS is to make sure that the manufacturing system can transfer from the original state to the final state, which is called reachabilty. Therefore, reachability analysis is one of the most important problems of FMS. When Petri Net is acyclic, the reachability analysis can be performed by finding a integer solution to a set of linear equation, named fundamental equation, which is known to be NP-complete. In this paper, a novel approach for finding the integer solution is applied by adopting a revised version of the cell enumeration method for an arrangement of hyperplanes in discrete geometry to identify firing count vector solution(s) to the fundamental equation on a bounded integer set with a complexity bound of O((nu)n¡m),where n is the number of nodes, m is the number of arcs and u is the upper bound of the number of firings for all individual arcs.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Peng, Wuxu, et Kia Makki. « Reachability and reverse reachability analysis of CFSMs ». Computer Communications 19, no 8 (juillet 1996) : 668–74. http://dx.doi.org/10.1016/s0140-3664(97)84932-8.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Fardigola, Larissa, et Kateryna Khalina. « Reachability and Controllability Problems for the Heat Equation on a Half-Axis ». Zurnal matematiceskoj fiziki, analiza, geometrii 15, no 1 (25 mars 2019) : 57–78. http://dx.doi.org/10.15407/mag15.01.057.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Li, Yuanbo, Kris Satya et Qirun Zhang. « Efficient algorithms for dynamic bidirected Dyck-reachability ». Proceedings of the ACM on Programming Languages 6, POPL (16 janvier 2022) : 1–29. http://dx.doi.org/10.1145/3498724.

Texte intégral
Résumé :
Dyck-reachability is a fundamental formulation for program analysis, which has been widely used to capture properly-matched-parenthesis program properties such as function calls/returns and field writes/reads. Bidirected Dyck-reachability is a relaxation of Dyck-reachability on bidirected graphs where each edge u → ( i v labeled by an open parenthesis “( i ” is accompanied with an inverse edge v → ) i u labeled by the corresponding close parenthesis “) i ”, and vice versa. In practice, many client analyses such as alias analysis adopt the bidirected Dyck-reachability formulation. Bidirected Dyck-reachability admits an optimal reachability algorithm. Specifically, given a graph with n nodes and m edges, the optimal bidirected Dyck-reachability algorithm computes all-pairs reachability information in O ( m ) time. This paper focuses on the dynamic version of bidirected Dyck-reachability. In particular, we consider the problem of maintaining all-pairs Dyck-reachability information in bidirected graphs under a sequence of edge insertions and deletions. Dynamic bidirected Dyck-reachability can formulate many program analysis problems in the presence of code changes. Unfortunately, solving dynamic graph reachability problems is challenging. For example, even for maintaining transitive closure, the fastest deterministic dynamic algorithm requires O ( n 2 ) update time to achieve O (1) query time. All-pairs Dyck-reachability is a generalization of transitive closure. Despite extensive research on incremental computation, there is no algorithmic development on dynamic graph algorithms for program analysis with worst-case guarantees. Our work fills the gap and proposes the first dynamic algorithm for Dyck reachability on bidirected graphs. Our dynamic algorithms can handle each graph update ( i.e. , edge insertion and deletion) in O ( n ·α( n )) time and support any all-pairs reachability query in O (1) time, where α( n ) is the inverse Ackermann function. We have implemented and evaluated our dynamic algorithm on an alias analysis and a context-sensitive data-dependence analysis for Java. We compare our dynamic algorithms against a straightforward approach based on the O ( m )-time optimal bidirected Dyck-reachability algorithm and a recent incremental Datalog solver. Experimental results show that our algorithm achieves orders of magnitude speedup over both approaches.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Zavattaro, Gianluigi. « Reachability Analysis in BioAmbients ». Electronic Notes in Theoretical Computer Science 227 (janvier 2009) : 179–93. http://dx.doi.org/10.1016/j.entcs.2008.12.111.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Szlobodnyik, Gergely, et Gábor Szederkényi. « Reachability Analysis of Low-Order Discrete State Reaction Networks Obeying Conservation Laws ». Complexity 2019 (26 mars 2019) : 1–13. http://dx.doi.org/10.1155/2019/1035974.

Texte intégral
Résumé :
In this paper we study the reachability problem of sub- and superconservative discrete state chemical reaction networks (d-CRNs). It is known that a subconservative network has bounded reachable state space, while that of a superconservative one is unbounded. The reachability problem of superconservative reaction networks is traced back to the reachability of subconservative ones. We consider network structures composed of reactions having at most one input and one output species beyond the possible catalyzers. We give a proof that, assuming all the reactions are charged in the initial and target states, the reachability problems of sub- and superconservative reaction networks are equivalent to the existence of nonnegative integer solution of the corresponding d-CRN state equations. Using this result, the reachability problem is reformulated as an Integer Linear Programming (ILP) feasibility problem. Therefore, the number of feasible trajectories satisfying the reachability relation can be counted in polynomial time in the number of species and in the distance of initial and target states, assuming fixed number of reactions in the system.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Shi, Qingkai, Yongchao Wang, Peisen Yao et Charles Zhang. « Indexing the extended Dyck-CFL reachability for context-sensitive program analysis ». Proceedings of the ACM on Programming Languages 6, OOPSLA2 (31 octobre 2022) : 1438–68. http://dx.doi.org/10.1145/3563339.

Texte intégral
Résumé :
Many context-sensitive dataflow analyses can be formulated as an extended Dyck-CFL reachability problem, where function calls and returns are modeled as partially matched parentheses. Unfortunately, despite many works on the standard Dyck-CFL reachability problem, solving the extended version is still of quadratic space complexity and nearly cubic time complexity, significantly limiting the scalability of program analyses. This paper, for the first time to the best of our knowledge, presents a cheap approach to transforming the extended Dyck-CFL reachability problem to conventional graph reachability, a much easier and well-studied problem. This transformation allows us to benefit from recent advances in reachability indexing schemes, making it possible to answer any reachability query in a context-sensitive dataflow analysis within almost constant time plus only a few extra spaces. We have implemented our approach in two common context-sensitive dataflow analyses, one determines pointer alias relations and the other tracks information flows. Experimental results demonstrate that, compared to their original analyses, we can achieve orders of magnitude (10 2 × to 10 5 ×) speedup at the cost of only a moderate space overhead. Our implementation is publicly available.
Styles APA, Harvard, Vancouver, ISO, etc.
8

Szlobodnyik, Gergely, et Gábor Szederkényi. « Polynomial Time Reachability Analysis in Discrete State Chemical Reaction Networks Obeying Conservation Laws ». MATCH - Communications in Mathematical and in Computer Chemistry 89, no 1 (août 2022) : 175–96. http://dx.doi.org/10.46793/match.89-1.175s.

Texte intégral
Résumé :
In this paper the reachability problem of discrete state Chemical Reaction Networks (d-CRNs) is studied. We consider sub-classes of sub-and superconservative d-CRN network structures and prove that the reachability relation can be decided in polynomial time. We make use of the result that in the studied d-CRN sub-classes, the reachability relation is equivalent to the existence of a non-negative integer solution of the d-CRN state equation. The equivalence implies the reformulation of the reachability problem as integer linear programming decision problem. We show that in the studied classes of d-CRN structures, the state equation has a totally unimodular coefficient matrix. As the reachability relation is equivalent to the non-negative integer solution of the state equation, the resulting integer programming decision program can be relaxed to a simple linear program having polynomial time complexity. Hence, in the studied sub-classes of sub and superconservative reaction network structures, the reachability relation can be decided in polynomial time and the number of continuous decision variables is equal to the number of reactions of the d-CRN.
Styles APA, Harvard, Vancouver, ISO, etc.
9

Li, Yuanbo, Qirun Zhang et Thomas Reps. « Single-Source-Single-Target Interleaved-Dyck Reachability via Integer Linear Programming ». Proceedings of the ACM on Programming Languages 7, POPL (9 janvier 2023) : 1003–26. http://dx.doi.org/10.1145/3571228.

Texte intégral
Résumé :
An interleaved-Dyck (InterDyck) language consists of the interleaving of two or more Dyck languages, where each Dyck language represents a set of strings of balanced parentheses.InterDyck-reachability is a fundamental framework for program analyzers that simultaneously track multiple properly-matched pairs of actions such as call/return, lock/unlock, or write-data/read-data.Existing InterDyck-reachability algorithms are based on the well-known tabulation technique. This paper presents a new perspective on solving InterDyck-reachability. Our key observation is that for the single-source-single-target InterDyck-reachability variant, it is feasible to summarize all paths from the source node to the target node based on path expressions . Therefore, InterDyck-reachability becomes an InterDyck-path-recognition problem over path expressions. Instead of computing summary edges as in traditional tabulation algorithms, this new perspective enables us to express InterDyck-reachability as a parenthesis-counting problem, which can be naturally formulated via integer linear programming (ILP). We implemented our ILP-based algorithm and performed extensive evaluations based on two client analyses (a reachability analysis for concurrent programs and a taint analysis). In particular, we evaluated our algorithm against two types of algorithms: (1) the general all-pairs InterDyck-reachability algorithms based on linear conjunctive language (LCL) reachability and synchronized pushdown system (SPDS) reachability, and (2) two domain-specific algorithms for both client analyses. The experimental results are encouraging. Our algorithm achieves 1.42×, 28.24×, and 11.76× speedup for the concurrency-analysis benchmarks compared to all-pair LCL-reachability, SPDS-reachability, and domain-specific tools, respectively; 1.2×, 69.9×, and 0.98× speedup for the taint-analysis benchmarks. Moreover, the algorithm also provides precision improvements, particularly for taint analysis, where it achieves 4.55%, 11.1%, and 6.8% improvement, respectively.
Styles APA, Harvard, Vancouver, ISO, etc.
10

Lei, Yuxiang, Yulei Sui, Shuo Ding et Qirun Zhang. « Taming transitive redundancy for context-free language reachability ». Proceedings of the ACM on Programming Languages 6, OOPSLA2 (31 octobre 2022) : 1556–82. http://dx.doi.org/10.1145/3563343.

Texte intégral
Résumé :
Given an edge-labeled graph, context-free language reachability (CFL-reachability) computes reachable node pairs by deriving new edges and adding them to the graph. The redundancy that limits the scalability of CFL-reachability manifests as redundant derivations, i.e., identical edges can be derived multiple times due to the many paths between two reachable nodes. We observe that most redundancy arises from the derivations involving transitive relations of reachable node pairs. Unfortunately, existing techniques for reducing redundancy in transitive-closure-based problems are either ineffective or inapplicable to identifying and eliminating redundant derivations during on-the-fly CFL-reachability solving. This paper proposes a scalable yet precision-preserving approach to all-pairs CFL-reachability analysis by taming its transitive redundancy. Our key insight is that transitive relations are intrinsically ordered, and utilizing the order for edge derivation can avoid most redundancy. To address the challenges in determining the derivation order from the dynamically changed graph during CFL-reachability solving, we introduce a hybrid graph representation by combining spanning trees and adjacency lists, together with a dynamic construction algorithm. Based on this representation, we propose a fast and effective partially ordered algorithm POCR to boost the performance of CFL-reachability analysis by reducing its transitive redundancy during on-the-fly solving. Our experiments on context-sensitive value-flow analysis and field-sensitive alias analysis for C/C++ demonstrate the promising performance of POCR. On average, POCR eliminates 98.50% and 97.26% redundant derivations respectively for the value-flow and alias analysis, achieving speedups of 21.48× and 19.57× over the standard CFL-reachability algorithm. We also compare POCR with two recent open-source tools, Graspan (a CFL-reachability solver) and Soufflé (a Datalog engine). The results demonstrate that POCR is over 3.67× faster than Graspan and Soufflé on average for both value-flow analysis and alias analysis.
Styles APA, Harvard, Vancouver, ISO, etc.
11

Neumann, Michael, et Ronald J. Stern. « Cone reachability for linear differential systems ». Applicable Analysis 20, no 1-2 (juillet 1985) : 57–71. http://dx.doi.org/10.1080/00036818508839558.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
12

Wu, Guodong, et Junyan Qian. « Reachability Analysis of Asynchronous Dynamic Pushdown Networks Based on Tree Semantics Approach ». World Journal of Social Science Research 4, no 4 (18 octobre 2018) : 287. http://dx.doi.org/10.22158/wjssr.v4n4p287.

Texte intégral
Résumé :
<em>ADPN (Asynchronous Dynamic Pushdown Networks) are an abstract model for concurrent programs with recursive procedures and dynamic thread creation. Usually, asynchronous dynamic pushdown networks are described with interleaving semantics, in which the backward analysis is not effective. In order to improve interleaving semantics, tree semantics approach was introduced. This paper extends the tree semantics to ADPN. Because the reachability problem of ADPN is also undecidable, we address the context-bounded reachability problem and provide an algorithm for backward reachability analysis with tree-based semantics Approach.</em>
Styles APA, Harvard, Vancouver, ISO, etc.
13

MIYAMOTO, Toshiyuki. « Reachability Analysis of Petri Nets ». IEICE ESS Fundamentals Review 13, no 1 (1 juillet 2019) : 20–27. http://dx.doi.org/10.1587/essfr.13.1_20.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
14

Nikolić, Đurica, et Fausto Spoto. « Reachability analysis of program variables ». ACM Transactions on Programming Languages and Systems 35, no 4 (décembre 2013) : 1–68. http://dx.doi.org/10.1145/2529990.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
15

Pomakis, Keith P., et Joanne M. Atlee. « Reachability analysis of feature interactions ». ACM SIGSOFT Software Engineering Notes 21, no 3 (mai 1996) : 216–23. http://dx.doi.org/10.1145/226295.226320.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
16

Reps, Thomas. « Program analysis via graph reachability ». Information and Software Technology 40, no 11-12 (décembre 1998) : 701–26. http://dx.doi.org/10.1016/s0950-5849(98)00093-7.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
17

BUFFET, OLIVIER. « REACHABILITY ANALYSIS FOR UNCERTAIN SSPs ». International Journal on Artificial Intelligence Tools 16, no 04 (août 2007) : 725–49. http://dx.doi.org/10.1142/s0218213007003527.

Texte intégral
Résumé :
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reachable. This article presents an algorithm checking for goal reachability, especially in the complex case of an uncertain SSP where only a possible interval is known for each transition probability. This gives an analysis method for determining if SSP algorithms such as RTDP are applicable, even if the exact model is not known. As this is a time-consuming algorithm, we also present a simple process that often speeds it up dramatically. Yet, the main improvement still needed is to turn to a symbolic analysis in order to avoid a complete state-space enumeration.
Styles APA, Harvard, Vancouver, ISO, etc.
18

Sharon, Yoav, et Michael Margaliot. « Third-order nilpotency, nice reachability and asymptotic stability ». Journal of Differential Equations 233, no 1 (février 2007) : 136–50. http://dx.doi.org/10.1016/j.jde.2006.10.011.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
19

Röger, Gabriele, Silvan Sievers et Michael Katz. « Symmetry-Based Task Reduction for Relaxed Reachability Analysis ». Proceedings of the International Conference on Automated Planning and Scheduling 28 (15 juin 2018) : 208–17. http://dx.doi.org/10.1609/icaps.v28i1.13904.

Texte intégral
Résumé :
Relaxed reachability analysis is relevant to efficient grounding, invariant synthesis as well as the computation of relaxation-based heuristics. Planning domains are typically specified in a lifted representation, where the size of the tasks grows exponentially with the number of objects in the world. This growth also affects the analysis of relaxed reachability. We present a task reduction based on symmetries of the lifted representation that allows to perform the same analysis on smaller tasks.
Styles APA, Harvard, Vancouver, ISO, etc.
20

Chistikov, Dmitry, Rupak Majumdar et Philipp Schepper. « Subcubic certificates for CFL reachability ». Proceedings of the ACM on Programming Languages 6, POPL (16 janvier 2022) : 1–29. http://dx.doi.org/10.1145/3498702.

Texte intégral
Résumé :
Many problems in interprocedural program analysis can be modeled as the context-free language (CFL) reachability problem on graphs and can be solved in cubic time. Despite years of efforts, there are no known truly sub-cubic algorithms for this problem. We study the related certification task: given an instance of CFL reachability, are there small and efficiently checkable certificates for the existence and for the non-existence of a path? We show that, in both scenarios, there exist succinct certificates ( O ( n 2 ) in the size of the problem) and these certificates can be checked in subcubic (matrix multiplication) time. The certificates are based on grammar-based compression of paths (for reachability) and on invariants represented as matrix inequalities (for non-reachability). Thus, CFL reachability lies in nondeterministic and co-nondeterministic subcubic time. A natural question is whether faster algorithms for CFL reachability will lead to faster algorithms for combinatorial problems such as Boolean satisfiability (SAT). As a consequence of our certification results, we show that there cannot be a fine-grained reduction from SAT to CFL reachability for a conditional lower bound stronger than n ω , unless the nondeterministic strong exponential time hypothesis (NSETH) fails. In a nutshell, reductions from SAT are unlikely to explain the cubic bottleneck for CFL reachability. Our results extend to related subcubic equivalent problems: pushdown reachability and 2NPDA recognition; as well as to all-pairs CFL reachability. For example, we describe succinct certificates for pushdown non-reachability (inductive invariants) and observe that they can be checked in matrix multiplication time. We also extract a new hardest 2NPDA language, capturing the “hard core” of all these problems.
Styles APA, Harvard, Vancouver, ISO, etc.
21

Loreti, Paola, et Daniela Sforza. « Reachability problems for a class of integro-differential equations ». Journal of Differential Equations 248, no 7 (avril 2010) : 1711–55. http://dx.doi.org/10.1016/j.jde.2009.09.016.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
22

Chen, Xingwu, Zhaoxia Wang et Weinian Zhang. « Reachability of maximal number of critical periods without independence ». Journal of Differential Equations 269, no 11 (novembre 2020) : 9783–803. http://dx.doi.org/10.1016/j.jde.2020.06.065.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
23

Lagnese, John E. « The reachability problem for thermoelastic plates ». Archive for Rational Mechanics and Analysis 112, no 3 (1990) : 223–67. http://dx.doi.org/10.1007/bf00381235.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
24

Everett, Michael, Golnaz Habibi, Chuangchuang Sun et Jonathan P. How. « Reachability Analysis of Neural Feedback Loops ». IEEE Access 9 (2021) : 163938–53. http://dx.doi.org/10.1109/access.2021.3133370.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
25

ZHANG, Hai-Bin, et Zhen-Hua DUAN. « Symbolic Reachability Analysis of Hybrid Systems ». Journal of Software 19, no 12 (13 novembre 2009) : 3111–21. http://dx.doi.org/10.3724/sp.j.1001.2008.03111.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
26

Kloetzer, Marius, et Calin Belta. « Reachability analysis of multi-affine systems ». Transactions of the Institute of Measurement and Control 32, no 5 (28 octobre 2009) : 445–67. http://dx.doi.org/10.1177/0142331208097838.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
27

XUE, ZHIXING, et RUEDIGER DILLMANN. « EFFICIENT GRASP PLANNING WITH REACHABILITY ANALYSIS ». International Journal of Humanoid Robotics 08, no 04 (décembre 2011) : 761–75. http://dx.doi.org/10.1142/s0219843611002654.

Texte intégral
Résumé :
Grasping can be seen as two steps: placing the hand at a grasping pose and closing the fingers. In this paper, we introduce an efficient algorithm for grasping pose generation. By the use of preshaping and eigen-grasping actions, the dimension of the space of possible hand configurations is reduced. The object to be grasped is decomposed into boxes of a discrete set of different sizes. By performing finger reachability analysis on the boxes, the kinematic feasibility of a grasp can be determined. If a reachable grasp is force-closure and can be performed by the robotic arm, its grasping forces are optimized and can be executed. The novelty of our algorithm is that it takes into account both the object geometrical information and the kinematic information of the hand to determine the grasping pose, so that a reachable grasping pose can be found very quickly. Real experiments with two different robotic hands show the efficiency and feasibility of our method.
Styles APA, Harvard, Vancouver, ISO, etc.
28

Gabr, Haitham, Andrei Todor, Alin Dobra et Tamer Kahveci. « Reachability Analysis in Probabilistic Biological Networks ». IEEE/ACM Transactions on Computational Biology and Bioinformatics 12, no 1 (1 janvier 2015) : 53–66. http://dx.doi.org/10.1109/tcbb.2014.2343967.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
29

Gan, Ting, Mingshuai Chen, Yangjia Li, Bican Xia et Naijun Zhan. « Reachability Analysis for Solvable Dynamical Systems ». IEEE Transactions on Automatic Control 63, no 7 (juillet 2018) : 2003–18. http://dx.doi.org/10.1109/tac.2017.2763785.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
30

Wong-Toi, Howard. « Symbolic Reachability Analysis of Hybrid Systems ». IFAC Proceedings Volumes 31, no 27 (septembre 1998) : 271–76. http://dx.doi.org/10.1016/s1474-6670(17)40040-1.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
31

Özdemir, Kadir, et Hasan Ural. « Protocol validation by simultaneous reachability analysis ». Computer Communications 20, no 9 (septembre 1997) : 772–88. http://dx.doi.org/10.1016/s0140-3664(97)00075-3.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
32

Kapinski, Jim, Klaus Schmidt et Bruce H. Krogh. « Reachability analysis using proximity based automata * ». IFAC Proceedings Volumes 37, no 18 (septembre 2004) : 315–20. http://dx.doi.org/10.1016/s1474-6670(17)30765-6.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
33

Wu, Chia-Ju. « State reachability analysis of fuzzy models ». Journal of the Franklin Institute 333, no 4 (juillet 1996) : 513–21. http://dx.doi.org/10.1016/0016-0032(96)00029-4.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
34

Behrmann, Gerd. « Distributed reachability analysis in timed automata ». International Journal on Software Tools for Technology Transfer 7, no 1 (28 novembre 2003) : 19–30. http://dx.doi.org/10.1007/s10009-003-0111-z.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
35

LISITSA, ALEXEI, et ANDREI P. NEMYTYKH. « REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION ». International Journal of Foundations of Computer Science 19, no 04 (août 2008) : 953–69. http://dx.doi.org/10.1142/s0129054108006066.

Texte intégral
Résumé :
We present an approach to verification of parameterized systems, which is based on program transformation technique known as supercompilation. In this approach the statements about safety properties of a system to be verified are translated into the statements about properties of the program that simulates and tests the system. Supercompilation is used then to establish the required properties of the program. In this paper we show that reachability analysis performed by supercompilation can be seen as the proof of a correctness condition by induction. We formulate suitable induction principles and proof strategies and illustrate their use by examples of verification of parameterized protocols.
Styles APA, Harvard, Vancouver, ISO, etc.
36

Cheung, Shing Chi, et Jeff Kramer. « Context constraints for compositional reachability analysis ». ACM Transactions on Software Engineering and Methodology 5, no 4 (octobre 1996) : 334–77. http://dx.doi.org/10.1145/235321.235323.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
37

Todor, Andrei, Haitham Gabr, Alin Dobra et Tamer Kahveci. « Large scale analysis of signal reachability ». Bioinformatics 30, no 12 (11 juin 2014) : i96—i104. http://dx.doi.org/10.1093/bioinformatics/btu262.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
38

Bouajjani, Ahmed, Javier Esparza et Tayssir Touili. « Reachability Analysis of Synchronized PA Systems ». Electronic Notes in Theoretical Computer Science 138, no 3 (décembre 2005) : 153–78. http://dx.doi.org/10.1016/j.entcs.2005.02.063.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
39

Feuillade, Guillaume, Thomas Genet et Val�rie Viet Triem Tong. « Reachability Analysis over Term Rewriting Systems ». Journal of Automated Reasoning 33, no 3-4 (octobre 2004) : 341–83. http://dx.doi.org/10.1007/s10817-004-6246-0.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
40

Holzmann, Gerard J. « An improved protocol reachability analysis technique ». Software : Practice and Experience 18, no 2 (février 1988) : 137–61. http://dx.doi.org/10.1002/spe.4380180203.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
41

Pavlogiannis, Andreas. « CFL/Dyck Reachability ». ACM SIGLOG News 9, no 4 (octobre 2022) : 5–25. http://dx.doi.org/10.1145/3583660.3583664.

Texte intégral
Résumé :
CFL/Dyck reachability is a simple graph-theoretic problem: given a CFL/Dyck language L over an alphabet Σ, a graph G = ( V , E ) of Σ-labeled edges, and two distinguished nodes s , t ∈ V , does there exist a path from s to t that spells out a word in L ? This simple notion of language-based graph reachability serves as the algorithmic formulation of a large number of problems in diverse domains, such as graph databases and program static analysis. This paper takes an algorithmic perspective on CFL/Dyck reachability, and overviews several recent advances concerning the decidability and complexity of the problem and some its close variants, as realized in the areas of automata theory and program verification.
Styles APA, Harvard, Vancouver, ISO, etc.
42

Marchenko, V. M. « Hybrid discrete-continuous systems : II. Controllability and reachability ». Differential Equations 49, no 1 (janvier 2013) : 112–25. http://dx.doi.org/10.1134/s0012266113010114.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
43

Ji, Jing, Gui Xiong Liu et Li Ming Wu. « Reachability Analysis of Perception Layer Scheduling for IoT ». Applied Mechanics and Materials 385-386 (août 2013) : 1689–92. http://dx.doi.org/10.4028/www.scientific.net/amm.385-386.1689.

Texte intégral
Résumé :
In this paper we present a method of reachability analysis for Internet of Things (IoT) perception layer scheduling. First, the model of perception layer information flow and behavior is formed. Because perception network is a system with coexistence of discrete events and successive events, so we use hybrid dynamic logic modeling approach to form the information perception model; Then inequality proving theory, semi-algebraic system and related tools Discoverer soft package are used to give reachability analysis of the model of perceptual system, and the feasibility of this method is verified by the vehicle condition monitoring system application.
Styles APA, Harvard, Vancouver, ISO, etc.
44

Zhou, Kai-Qing, Li-Ping Mo, Lei Ding et Wei-Hua Gui. « An Automatic Algorithm to Generate a Reachability Tree for Large-Scale Fuzzy Petri Net by And/Or Graph ». Symmetry 10, no 10 (1 octobre 2018) : 454. http://dx.doi.org/10.3390/sym10100454.

Texte intégral
Résumé :
Fuzzy Petri net (FPN) is widely used to repre sent, model and analyse knowledge-based systems (KBSs). Meanwhile, a reachability tree is an important tool to fully represent the flow relationship of FPN and is widely applied to implement inference in industrial areas. However, the traditional reachability ignores recording the dependence relationships (‘and/or’ relationship) among the places in the neighbouring layers. This paper develops a modified reachability tree based on an and/or graph and presents a three-phase generation algorithm to model the reachability tree for the corresponding FPN automatically via fuzzy production rules (FPRs). Four cases are used to verify the correctness and feasibility of the proposed algorithm from different viewpoints, such as general FPRs, FPRs with a condition-sharing situation, FPRs with a conclusion-sharing situation, and FPRs with multi-conclusions. Simulation results reveal that the proposed approach has the ability to automatically generate the reachability tree for the corresponding FPN correctly.
Styles APA, Harvard, Vancouver, ISO, etc.
45

Wang, Xu-Feng, Jian-Min Li, Xing-Wei Kong, Xin-Min Dong et Bo Zhang. « Towards docking safety analysis for unmanned aerial vehicle probe-drogue autonomous aerial refueling based on docking success-probability and docking reachability ». Proceedings of the Institution of Mechanical Engineers, Part G : Journal of Aerospace Engineering 233, no 11 (16 octobre 2018) : 3893–905. http://dx.doi.org/10.1177/0954410018806804.

Texte intégral
Résumé :
Docking safety is a key problem during the docking phase of the unmanned aerial vehicle probe-drogue autonomous aerial refueling (UAV-PD-AAR). To solve this problem, a novel and effective method based on docking success-probability and docking reachability is presented in this paper. Firstly, by employing the location of the drogue with respect to the probe, a docking success-probability estimation algorithm is proposed to give the probe-drogue docking success-probability in real time, with UAV control and drogue attitude considered. Secondly, considering UAV longitudinal dynamics, a docking reachability calculation algorithm for docking reachable set is designed to ensure the UAV can safely reach the docking target set, by using Hamilton–Jacobi equation. Finally, the docking safety algorithm during the docking phase of UAV-PD-AAR is constructed, based on the estimated docking success-probability and the calculated docking reachability. The experiments of docking success-probability estimation and docking reachability calculation were conducted, which can be used towards docking safety analysis during the docking phase of UAV-PD-AAR.
Styles APA, Harvard, Vancouver, ISO, etc.
46

Zhao, Shouwei, Jitao Sun et Hai Lin. « Geometric Analysis of Reachability and Observability for Impulsive Systems on Complex Field ». Journal of Applied Mathematics 2012 (2012) : 1–12. http://dx.doi.org/10.1155/2012/876120.

Texte intégral
Résumé :
Nowadays, quantum systems have become one of the focuses of the ongoing research and they are typical complex systems, whose state variables are defined on the complex field. In this paper, the issue of reachability and observability is addressed for a class of linear impulsive systems on complex field, for simplicity, complex linear impulsive systems. This kind of time-driven impulsive systems allows free impulsive instants, which leads to the limitation of using traditional definitions of reachability and observability directly. New notations about the span reachable set and unobservable set are proposed. Sufficient and necessary conditions for span reachability and observability of such systems are established. Moreover, the explicit characterization of span reachable set and unobservable set is presented by geometric analysis. It is pointed out that the geometric conditions are equivalent to the algebraic ones in known results for special cases. Numerical examples are also presented to show the effectiveness of the proposed methods.
Styles APA, Harvard, Vancouver, ISO, etc.
47

Chen, Chyun Chyi, et Yueh Min Huang. « Using Time Reachability Tree Logic to Specifying and Verifying Temporal Behavior of Workflow-Net ». Applied Mechanics and Materials 571-572 (juin 2014) : 528–34. http://dx.doi.org/10.4028/www.scientific.net/amm.571-572.528.

Texte intégral
Résumé :
Workflow management has been a hot issue in both academic and industrial research. Deadline assignment is of great significance in workflow management. In order to avoid deadline violation, this paper presents an approach to the schedulability analysis of workflow system modeled in p-time Petri nets by separating timing properties from other behavior properties. The analysis of behavioral properties is conducted based on the reachability graph of the underlying p-Time Petri net, whereas timing constraints are checked in term of absolute and relative firing domains. Our technique is based on a concept called clock-stamped state class (CS-class) and temporal logic. With the reachability graph generated based on CS-class, we can directly compute the end-to-end time delay in workflow execution. We have identified a class of well-structured p-time Petri nets such that their reachability can be easy analyzed and temporal behavior can be easy analyzed by time reachability tree logical.
Styles APA, Harvard, Vancouver, ISO, etc.
48

Huang, Xinlin, Jianmin Gao, Hongquan Jiang, Zhiyong Gao et Fumin Chen. « Fault root cause tracing of complicated equipment based on fault graph ». Proceedings of the Institution of Mechanical Engineers, Part E : Journal of Process Mechanical Engineering 227, no 1 (29 mai 2012) : 17–32. http://dx.doi.org/10.1177/0954408912445957.

Texte intégral
Résumé :
Fault root causes tracing of complicated equipment in modern process industry is very important for accident and economic loss prevention. Due to the structure complexity of complicated equipment, failures happen from small parts and propagate through complex pathways often leading to serious system faults. These kind of faults caused by non-critical parts account for a large part of all the faults of complicated equipment and often cannot get enough attention in fault diagnosis. In order to trace the root causes of this kind of fault, the failure dependent relationship and fault propagation mode must be modeled accurately and effectively. Fault graph proposed by H. P. Alesso is a useful tool to represent complex structure and fault propagation pathway of complicated equipment with a special kind of fault-oriented directed graph expanded from fault tree. Fault graph takes advantage of graph rather than tree to describe complex relation between failure modes of components, and uses logic connectives to connect failure modes with logical relationship. Based on the basic concept of fault graph introduced by H. P. Alesso, this article focuses on the issues of fault graph constructing and fault graph fault root causes deducing. A fault graph constructing method was firstly discussed which uses the results of failure mode and effects analysis and the mathematical tool of polychromatic matrix and can be easily performed with the least manual work. Then the fault root causes deducing method of fault graph was investigated which focuses on fault graph reachability calculation and fault propagation pathway searching. The fault graph reachability calculation is put forward from doubletons to multiple root causes so that the reachabiltiy of any steps of fault graph pathway can be calculated. The fault propagation pathway searching method can be performed to reveal the detailed fault propagation pathway. A case study of fault graph modeling and fault root causes analysis based on fault graph of a certain type of centrifugal compressor which has complex internal structure is introduced. The case study shows that the proposed method is effective for fault root cause tracing of complicated equipment.
Styles APA, Harvard, Vancouver, ISO, etc.
49

Rublev, I. V. « Reachability set of a three-dimensional cascade control system ». Differential Equations 42, no 12 (décembre 2006) : 1745–54. http://dx.doi.org/10.1134/s0012266106120093.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
50

Meyer, Pierre-Jean, et Murat Arcak. « Interval Reachability Analysis using Second-Order Sensitivity ». IFAC-PapersOnLine 53, no 2 (2020) : 1825–30. http://dx.doi.org/10.1016/j.ifacol.2020.12.2344.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Vous pouvez également être intéressé par les bibliographies sur le sujet « Reachability Analysi » pour d’autres types de sources :
Thèses
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie