Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 132 for “"Reachability analysis"”.
-
Leveraging SMT Solvers for Reachability Analysis
Reachability analysis is fundamental to formal verification of distributed systems, network protocols, and concurrent software, enabling verification of safety and liveness properties. However, the explosive growth of state spaces makes reachability analysis computationally prohibitive for many …
-
Symbolic reachability analysis for rewrite theories
… in automatic and semi-automatic reasoning for reachability properties of rewriting logic specifications, a major research goal in the current state of the art. In particular, this work develops deductive techniques for reasoning symbolically about specifications with initial model semantics, …
-
Hybrid Reachability Analysis for Kuramoto-Lanchester Model
… reliability. However, their complexity makes analysis particularly challenging and computationally expensive. Thus, it is crucial to develop tools to efficiently analyze cyber-physical systems and their safety properties. Cyber-physical systems are often modeled by hybrid automata, i.e. …
-
Protocol validation via reachability analysis : an implementation
Reachability analysis is one of the earliest and most common techniques for protocol validation. It is well suited to checking the protocol syntactic properties since they are a direct consequence of the structure of the reachability tree. However, validations of unbounded protocols via …
-
LOW-THRUST REACHABILITY ANALYSIS BY ANALYTICAL MEANS
… algorithmic process can be used to support a reachability assessment of a noncooperative spacecraft in cislunar space.
-
Advances in Reachability Analysis for Nonlinear Dynamic Systems
Systems of nonlinear ordinary differential equations (ODEs) are used to model an incredible variety of dynamic phenomena in chemical, oil and gas, and pharmaceutical industries. In reality, such models are nearly always subject to significant uncertainties in their initial conditions, parameters, …
-
Decision diagrams: Extensions and applications to reachability analysis
… are increasingly popular tools for the analysis of complex systems. Given a high-level model of a system, such as a Petri Net, we can automatically verify certain properties about it. In this thesis, we develop data structures and techniques that can be used to improve such analyses.</p> …
-
Projectagon-based reachability analysis for circuit-level formal verification
… is based on translating verification problems to reachability analysis problems. It applies nonlinear ODEs to model circuit dynamics using modified nodal analysis. Forward reachable regions are computed from given initial states to explore all possible circuit behaviors. Analog properties are …
-
Coho : a verification tool for circuit verification by reachability analysis
… (ODEs). Verification is performed using reachability analysis. The reachable space is represented by projectagons which are the polyhedron described by their projection onto two dimensional subspace. COHO approximates nonlinear ODEs with linear differential inclusions to compute the …
-
Directed unfolding: reachability analysis of concurrent systems & applications to automated planning.
… models, yet automated planning and Petri net analysis have developed independently, with minimal and mainly unconvincing attempts at crossfertilisation. This thesis exploits the relationship between the formal reachability problem, and the automated planning problem, via Petri net unfolding, …
-
On Pragmatic System Design through Learning and Implementation-oriented Reachability Analysis
… extraction from example behavior traces, and (4) reachability analysis for dynamical system implementations (C/C++ code).
-
Static reachability analysis and validation regarding security policies implemented via packet filters
… difficult and complex problem. Factors affecting reachability analysis are packet filters, routing policies and packet transformations. The number of variables within and among networks is intractable for manual computation. A proposed solution to this mess is a tractable framework for which to …
-
Trajectory planning under motion and sensing uncertainties: reachability analysis and connectivity maintenance
… while designing trajectory planning algorithms. Reachability analysis is a popular verification-based tool where reachable sets for the robot are first computed along candidate trajectories and then used to plan collision-safe trajectories. However, previous works do not explicitly account for …
-
AUTONOMOUS SPACECRAFT RENDEZVOUS WITH A TUMBLING OBJECT: APPLIED REACHABILITY ANALYSIS AND GUIDANCE AND CONTROL STRATEGIES
… This dissertation presents an applied reachability analysis and develops a computationally feasible autonomous guidance algorithm for the purpose of spacecraft rendezvous and proximity maneuvers around a tumbling object. Recent advancements enable the use of more sophisticated, …
-
Reachability Analysis of RTL Circuits Using k-Induction Bounded Model Checking and Test Vector Compaction
… and property partitioning for proving unreachability of branches in Verilog RTL code is presented. To do this, it approach uses program slicing with respect to the variables of the property under test to generate small-sized SMT formulas that describe the change of variable values between …
-
Automated network protocol reachability analysis with supertrace algorithm and TESTGEN : automated generation of test sequence for a formal protocol specification
The automation of reachability analysis is an important step in verification of network protocols. The memory size needed for the full state analysis of complex protocols is usually very large and not available on most of the systems. A controlled partial search algorithm 'Supertrace' is …
-
On exploring even reachable global state space to verify deadlock freedom of protocols.
… Peng introduced another relief strategy for reachability analysis, called even reachability analysis. In the proceedings of ICCCN'95, Peng also attempts to prove that deadlock freedom of any n-process protocol with arbitrary topology is verifiable by even reachability analysis with more than …
-
Improving state exploration techniques for the automatic verification of concurrent systems.
… (space) exploration, commonly known also as reachability analysis, amounts to exploring in a systematic manner the entire state space of a system. One of the main causes of the state explosion problem in the verification of concurrent systems is the modeling of concurrency by the exploration …
-
A FORMAL MODEL AND SPECIFICATION TECHNIQUE FOR COMPLETE AND AUTOMATED VERIFICATION OF COMMUNICATION PROTOCOLS
… of the completeness of the representation, the reachability analysis on the PT A model yields considerably stronger results than comparable analysis in existing models. Reachability analysis applied to other state-transition models can be used to verify only syntactic properties such as …
-
Verifying the safety properties of concurrent systems via simultaneous reachability.
This thesis proposes two techniques, simultaneous reachability analysis and simultaneous product method, to reduce the number of global states to be analyzed for verifying the safety properties of concurrent systems. Both techniques utilize the idea of simultaneous execution of transitions. …
Page 1 of 7