Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology

DOI10.1007/S10626-009-0082-7MaRDI QIDQ843992zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

hybrid automatareachability problemfirst-order logicsapproximate semantics

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Attainable sets, reachability (93B03) Automated systems (robots, etc.) in control theory (93C85)

Recommendations

• Hybrid automata, reachability, and systems biology
• \(\epsilon\)-semantics computations on biological systems
• Hybrid Automata in Systems Biology: How Far Can We Go?
• Inclusion dynamics hybrid automata
• scientific article; zbMATH DE number 1303067

Cites work

• scientific article; zbMATH DE number 3825882 (Why is no real title available?)
• scientific article; zbMATH DE number 1257634 (Why is no real title available?)
• scientific article; zbMATH DE number 1263213 (Why is no real title available?)
• scientific article; zbMATH DE number 1303061 (Why is no real title available?)
• scientific article; zbMATH DE number 1956633 (Why is no real title available?)
• scientific article; zbMATH DE number 1798190 (Why is no real title available?)
• scientific article; zbMATH DE number 1905118 (Why is no real title available?)
• scientific article; zbMATH DE number 1424031 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• A cellular automaton model for neurogenesis in \textit{Drosophila}
• A theory of timed automata
• Approximate bisimulation relations for constrained linear systems
• Approximate simulation relations for hybrid systems
• Automated Technology for Verification and Analysis
• Complexity of deciding Tarski algebra
• Computer Aided Verification
• Hierarchical control system design using approximate simulation
• O-minimal hybrid systems.
• On the combinatorial and algebraic complexity of quantifier elimination
• 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 regularization of Zeno hybrid automata
• Petri net modelling of biological regulatory networks
• The algorithmic analysis of hybrid systems

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?

Describes a project that uses

Uses Software

• Pyhybridanalysis
• d/dt
• MATISSE

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)