Fixed Point Iteration for Computing the Time Elapse Operator

No abstract is available for this paper.

• Publication year

  2006

• Venue

  International Conference on Hybrid Systems: Computation and Control

• Publication date

  2006-03-29

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/11730637_40
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Safety verification of hybrid systems by constraint propagation-based abstraction refinement

  2007cited by this paper
• Generating Polynomial Invariants for Hybrid Systems

  2005cited by this paper
• Algorithmic Algebraic Model Checking I: Challenges from Systems Biology

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

  2005cited by this paper
• Benchmarks for Hybrid Systems Verification

  2004cited by this paper
• Nonlinear Systems: Approximating Reach Sets

  2004cited by this paper
• Constructing invariants for hybrid systems

  2004cited by this paper
• Safety Verification of Hybrid Systems Using Barrier Certificates

  2004cited by this paper
• Precise widening operators for convex polyhedra

  2003cited by this paper
• Approximate Reachability for Linear Systems

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

  2002cited by this paper
• The d/dt Tool for Verification of Hybrid Systems

  2002cited by this paper
• Modeling and Verifying Hybrid Dynamic Systems Using CheckMate

  2001cited by this paper
• Symbolic Reachability Computation for Families of Linear Vector Fields

  2001cited by this paper
• Formal verification of hybrid systems using CheckMate: a case study

  2000cited by this paper
• Polyhedral Analysis for Synchronous Languages

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

  1998cited by this paper
• Computing polyhedral approximations to flow pipes for dynamic systems

  1998cited by this paper
• Verification of Real-Time Systems using Linear Relation Analysis

  1997cited by this paper
• Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation

  1992influential reference
• Introduction to lattices and order

  1990cited by this paper
• Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

  1977influential reference

• Cone-Based Abstract Interpretation for Nonlinear Positive Invariant Synthesis

  2024cites this paper
• Underapproximating Backward Reachable Sets by Semialgebraic Sets

  2017cites this paper
• Change-of-bases abstractions for non-linear hybrid systems

  2016cites this paper
• Characterizing Algebraic Invariants by Differential Radical Invariants (CMU-CS-13-129)

  2014cites this paper
• Characterizing Algebraic Invariants by Differential Radical Invariants

  2014cites this paper
• Change-Of-Bases Abstractions for Non-Linear Systems

  2012influential citation
• Generating invariants of hybrid systems via sums-of-squares of polynomials with rational coefficients

  2012cites this paper
• Automatic abstraction of non-linear systems using change of bases transformations

  2011cites this paper
• Relational Abstractions for Continuous and Hybrid Systems

  2011influential citation
• Automatic invariant generation for hybrid systems using ideal fixed points

  2010cites this paper
• Verification Constraint Problems with Strengthening

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

  2006cites this paper