Reachability Analysis of Hybrid Systems via Predicate Abstraction

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-45873-5_6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Efficient Weighted Model Integration via SMT-Based Predicate Abstraction

2017English

Algorithmic Analysis of Polygonal Hybrid Systems, Part I: Reachability

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2007English

Probabilistic Reachability Analysis for Large Scale Stochastic Hybrid Systems

2007English

Avoiding Geometric Intersection Operations in Reachability Analysis of Hybrid Systems

2012English

Analysis of Lactose Metabolism in E.coli Using Reachability Analysis of Hybrid Systems

IET Systems Biology
GeneticsCell BiologyMolecular BiologySimulationModelingBiotechnology
2007English

ProbReach: A Tool for Guaranteed Reachability Analysis of Stochastic Hybrid Systems

English

Counterexample-Guided Abstraction-Refinement for Hybrid Systems Diagnosability Analysis

English

Refining Approximations in Software Predicate Abstraction

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Reachability Analysis of Communicating Pushdown Systems

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy