Automatic Rectangular Refinement of Affine Hybrid Systems

No abstract is available for this paper.

• Publication year

  2005

• Venue

  International Conference on Formal Modeling and Analysis of Timed Systems

• Publication date

  2005-09-26

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1007/11603009_13
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Influence of cultivation temperature on the ligninolytic activity of selected fungal strains

  2006cited by this paper
• PHAVer: algorithmic verification of hybrid systems past HyTech

  2005cited by this paper
• Benchmarks for Hybrid Systems Verification

  2004cited by this paper
• A Temporal Logic of Nested Calls and Returns

  2004cited by this paper
• Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library

  2002cited by this paper
• Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems

  2000cited by this paper
• Counterexample-Guided Abstraction Refinement

  2000cited by this paper
• Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States

  1999cited by this paper
• Hybrid Systems: Computation and Control

  1998cited by this paper
• Algorithmic Analysis of Nonlinear Hybrid Systems

  1998cited by this paper
• The theory of hybrid automata

  1996cited by this paper
• The Algorithmic Analysis of Hybrid Systems

  1995cited by this paper
• What's decidable about hybrid automata?

  1995cited by this paper
• A User Guide to HyTech

  1995cited by this paper
• Calculus of Communicating Systems

  1991cited by this paper
• Edinburgh Research Explorer Computational Adequacy in an Elementary Topos

  year unknowncited by this paper

• Symmetry-Based Abstractions for Hybrid Automata

  2024cites this paper
• Symmetry-based Abstraction Algorithm for Accelerating Symbolic Control Synthesis

  2024cites this paper
• Asynchronous Correspondences Between Hybrid Trajectory Semantics

  2022cites this paper
• Chapter 30: Verification of Hybrid Systems

  2021cites this paper
• Model-bounded Monitoring of Hybrid Systems

  2021cites this paper
• Model-bounded monitoring of hybrid systems

  2021cites this paper
• Automatic time-unbounded reachability analysis of hybrid systems

  2019cites this paper
• Verification and control for probabilistic hybrid automata with finite bisimulations

  2019cites this paper
• Bracketing backward reach sets of a dynamical system

  2019cites this paper
• Verification of Hybrid Systems

  2018cites this paper
• DryVR: Data-Driven Verification and Compositional Reasoning for Automotive Systems

  2017cites this paper
• Counterexample-Guided Refinement of Template Polyhedra

  2017cites this paper
• HARE: A Hybrid Abstraction Refinement Engine for Verifying Non-linear Hybrid Automata

  2017cites this paper
• An Algorithmic Approach for Stability Verification of Hybrid Systems

  2017cites this paper
• Conic Abstractions for Hybrid Systems

  2017cites this paper
• A Comprehensive Method for Reachability Analysis of Uncertain Nonlinear Hybrid Systems

  2016cites this paper
• Hybridization for Stability Analysis of Switched Linear Systems

  2016cites this paper
• From non-zenoness verification to termination

  2015cites this paper
• Verification and Control of Probabilistic Rectangular Hybrid Automata

  2015cites this paper
• AVERIST: An Algorithmic Verifier for Stability

  2015cites this paper
• Refactoring, Refinement, and Reasoning - A Logical Characterization for Hybrid Systems

  2014cites this paper
• A Continuous ASM Modelling Approach to Pacemaker Sensing

  2014cites this paper
• Formal verification and simulation for platform screen doors and collision avoidance in subway control systems

  2014cites this paper
• Assume-Guarantee Abstraction Refinement Meets Hybrid Systems

  2014cites this paper
• Bidirectional refinement of affine hybrid systems based on qualitative reasoning

  2013cites this paper
• Hybrid automata-based CEGAR for rectangular hybrid systems

  2013cites this paper
• Transactions on Computational Systems Biology XIV

  2012influential citation
• Continuous KAOS, ASM, and formal control system design across the continuous/discrete modeling interface: a simple train stopping application

  2012cites this paper
• On Approximative Reachability Analysis of Biochemical Dynamical Systems

  2012cites this paper
• Games and Automata: From Boolean to Quantitative Verification Memoire d'HabilitationDiriger des Recherches

  2011cites this paper
• Discrete-Time Verification and Control for Probabilistic Rectangular Hybrid Automata

  2011cites this paper
• Reachability Problems for Hybrid Automata

  2011cites this paper
• Efficient Bounded Reachability Computation for Rectangular Automata

  2011cites this paper
• Publications Du Groupe « Vérification Et Méthodes Formelles »

  2011cites this paper
• Reachability Analysis of Non-linear Planar Autonomous Systems

  2011influential citation
• Reachability in Biochemical Dynamical Systems by Quantitative Discrete Approximation

  2011cites this paper
• Computing reachable sets for uncertain nonlinear hybrid systems using interval constraint propagation techniques

  2011cites this paper
• Approximation Based Safety and Stability Verification of Hybrid Systems

  2011cites this paper
• Rectangular refinement of affine hybrid systems based on qualitative reasoning

  2010cites this paper
• Computing reachable sets for uncertain nonlinear monotone systems

  2010cites this paper
• Approximation garantie de l'espace d'état atteignable des systèmes dynamiques continus incertains. Encadrement par intervalle de flot d'état

  2009cites this paper
• A Hybrid Bounding Method for Computing an Over-Approximation for the Reachable Set of Uncertain Nonlinear Systems

  2009cites this paper
• Reachability of Uncertain Nonlinear Systems Using a Nonlinear Hybridization

  2008cites this paper
• Applications of polyhedral computations to the analysis and verification of hardware and software systems

  2007cites this paper
• Language-Based Abstraction Refinement for Hybrid System Verification

  2007cites this paper
• On Timed Simulation Relations for Hybrid Systems and Compositionality

  2006influential citation
• The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems

  2006cites this paper
• Recent progress in continuous and hybrid reachability analysis

  2006cites this paper
• PHAVer: algorithmic verification of hybrid systems past HyTech

  2005influential citation
• FOUNDATIONS OF HYBRID AND EMBEDDED SYSTEMS AND SOFTWARE NSF/ITR PROJECT – AWARD NUMBER: CCR-00225610 UNIVERSITY OF CALIFORNIA AT BERKELEY

  2005cites this paper