Quantifier-free encoding of invariants for hybrid systems
From MaRDI portal
Publication:479826
DOI10.1007/s10703-013-0202-8zbMath1317.68111OpenAlexW2074838304WikidataQ62041149 ScholiaQ62041149MaRDI QIDQ479826
Sergio Mover, Alessandro Cimatti, Stefano Tonetta
Publication date: 5 December 2014
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-013-0202-8
Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hybrid systems: From verification to falsification by combining motion planning and discrete search
- Abstractions for hybrid systems
- Improving SAT Modulo ODE for Hybrid Systems Analysis by Combining Different Enclosure Methods
- Symbolic Reachability Analysis of Lazy Linear Hybrid Automata
- SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems
- The Image Computation Problem in Hybrid Systems Model Checking
- Requirements Validation for Hybrid Systems
- Path-Oriented Reachability Verification of a Class of Nonlinear Hybrid Automata Using Convex Programming
- On the decidability of continuous time specification formalisms
- Algorithmic analysis of nonlinear hybrid systems
- Verification in continuous time by discrete reasoning
- Translating Time-Course Gene Expression Profiles into Semi-algebraic Hybrid Automata Via Dimensionality Reduction
- Verification, Model Checking, and Abstract Interpretation
- Computer Aided Verification
- Symbolic reachability computation for families of linear vector fields
This page was built for publication: Quantifier-free encoding of invariants for hybrid systems
