Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology
From MaRDI portal
Publication:843992
DOI10.1007/s10626-009-0082-7zbMath1180.93071OpenAlexW1499482550MaRDI QIDQ843992
Carla Piazza, Alberto Casagrande, Alberto Policriti
Publication date: 18 January 2010
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10626-009-0082-7
Automated systems (robots, etc.) in control theory (93C85) Cellular automata (computational aspects) (68Q80) Attainable sets, reachability (93B03)
Related Items (2)
\(\epsilon\)-semantics computations on biological systems ⋮ Quasi-decidability of a fragment of the first-order theory of real numbers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The algorithmic analysis of hybrid systems
- Petri net modelling of biological regulatory networks
- Approximate simulation relations for hybrid systems
- Hierarchical control system design using approximate simulation
- 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
- Complexity of deciding Tarski algebra
- A theory of timed automata
- A cellular automaton model for neurogenesis in \textit{Drosophila}
- O-minimal hybrid systems.
- On the regularization of Zeno hybrid automata
- Approximate bisimulation relations for constrained linear systems
- On the combinatorial and algebraic complexity of quantifier elimination
- Automated Technology for Verification and Analysis
- Computer Aided Verification
This page was built for publication: Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology
