Inclusion dynamics hybrid automata
From MaRDI portal
Publication:999262
DOI10.1016/j.ic.2008.09.001zbMath1153.68400OpenAlexW2104433288MaRDI QIDQ999262
Alberto Policriti, Bud Mishra, Alberto Casagrande, Carla Piazza
Publication date: 3 February 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2008.09.001
Related Items (3)
\(\epsilon\)-semantics computations on biological systems ⋮ Unnamed Item ⋮ Unwinding biological systems
Cites Work
- \(p\)-adic and real subanalytic sets
- The algorithmic analysis of hybrid systems
- Model-checking in dense real-time
- Continuous selections. I
- The theory of metabolism-repair systems
- Formal methods for industrial applications. Specification and programming the Steam Boiler Control
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Counting connected components of a semialgebraic set in subexponential time
- Complexity of deciding Tarski algebra
- On the real exponential field with restricted analytic functions
- A theory of timed automata
- The elementary theory of restricted analytic fields with exponentiation
- Théorème de préparation pour les fonctions logarithmico-exponentielles. (Preparation theorem for logarithmico-exponential functions)
- Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice
- Geometric categories and o-minimal structures
- A theorem of the complement and some new o-minimal structures
- O-minimal hybrid systems.
- Schanuel's conjecture and free exponential rings
- Improved Algorithms for Sign Determination and Existential Quantifier Elimination
- Paraconvex Sets.
- A generalization of the Tarski-Seidenberg theorem, and some nondefinability results
- On the combinatorial and algebraic complexity of quantifier elimination
- The abstract cauchy‐kovalevskaya theorem in a weighted banach space
- Hybrid Systems: Computation and Control
- Some realizations of (M, R)-systems and their interpretation
- Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function
- Computer Aided Verification
- The axiom of choice
- Symbolic reachability computation for families of linear vector fields
- State equivalences for rectangular hybrid automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Inclusion dynamics hybrid automata
