Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology
DOI10.1007/S10626-009-0082-7zbMATH Open1180.93071OpenAlexW1499482550MaRDI QIDQ843992FDOQ843992
Authors: Alberto Casagrande, Carla Piazza, 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
Recommendations
Cellular automata (computational aspects) (68Q80) Attainable sets, reachability (93B03) Automated systems (robots, etc.) in control theory (93C85)
Cites Work
- Approximate bisimulation relations for constrained linear systems
- A theory of timed automata
- On the regularization of Zeno hybrid automata
- O-minimal hybrid systems.
- Title not available (Why is that?)
- Title not available (Why is that?)
- The algorithmic analysis of hybrid systems
- Petri net modelling of biological regulatory networks
- Title not available (Why is that?)
- On the combinatorial and algebraic complexity of quantifier elimination
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Hierarchical control system design using approximate simulation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computer Aided Verification
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate simulation relations for hybrid systems
- A cellular automaton model for neurogenesis in \textit{Drosophila}
- Automated Technology for Verification and Analysis
Cited In (5)
- Special issue: Hybrid automata and oscillatory behavior in biological systems. Selected papers based on the presentations at the 2nd From biology to concurrency and back workshop (FBTC 2008), Reykjavik, Iceland, July 12, 2008
- \(\epsilon\)-semantics computations on biological systems
- Hybrid automata, reachability, and systems biology
- Quasi-decidability of a fragment of the first-order theory of real numbers
- Hybrid Automata in Systems Biology: How Far Can We Go?
Uses Software
This page was built for publication: Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q843992)
