Algorithmic algebra
Hybrid systems and constraint logic programming
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Complexity and real computation
Complexity and real computation
Mathematical physiology
Polynomial Algorithms in Computer Algebra
Polynomial Algorithms in Computer Algebra
A Symbolic Approachto Modeling Cellular Behavior
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
A Symbolic Approachto Modeling Cellular Behavior
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Verification of Polyhedral-Invariant Hybrid Automata Using Polygonal Flow Pipe Approximations
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Series of Abstractions for Hybrid Automata
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Progress on reachability analysis of hybrid systems using predicate abstraction
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Automated symbolic reachability analysis: with application to delta-notch signaling automata
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Taylor approximation for hybrid systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Simulation and verification for computational modelling of signalling pathways
Proceedings of the 38th conference on Winter simulation
Towards a Hybrid Dynamic Logic for Hybrid Dynamic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Taylor approximation for hybrid systems
Information and Computation
Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Differential Dynamic Logic for Verifying Parametric Hybrid Systems
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Computing Differential Invariants of Hybrid Systems as Fixedpoints
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Inclusion dynamics hybrid automata
Information and Computation
Approximated Reachability on Hybrid Automata: Falsification meets Certification
Electronic Notes in Theoretical Computer Science (ENTCS)
Hybrid Automata in Systems Biology: How Far Can We Go?
Electronic Notes in Theoretical Computer Science (ENTCS)
Hybrid systems: from verification to falsification by combining motion planning and discrete search
Formal Methods in System Design
A Uniform Approach to Three-Valued Semantics for μ-Calculus on Abstractions of Hybrid Automata
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
Property Driven Three-Valued Model Checking on Hybrid Automata
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Computing differential invariants of hybrid systems as fixedpoints
Formal Methods in System Design
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Discrete Semantics for Hybrid Automata
Discrete Event Dynamic Systems
The image computation problem in hybrid systems model checking
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Hybrid automata, reachability, and Systems Biology
Theoretical Computer Science
Algebraic systems biology: theses and hypotheses
AB'07 Proceedings of the 2nd international conference on Algebraic biology
AB'07 Proceedings of the 2nd international conference on Algebraic biology
AB'07 Proceedings of the 2nd international conference on Algebraic biology
Algorithmic algebraic model checking IV: characterization of metabolic networks
AB'07 Proceedings of the 2nd international conference on Algebraic biology
Hybrid systems: from verification to falsification
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Hybrid systems and biology: continuous and discrete modeling for systems biology
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
Symbolic model checking of hybrid systems using template polyhedra
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Generating invariants for non-linear hybrid systems by linear algebraic methods
SAS'10 Proceedings of the 17th international conference on Static analysis
A dynamic algorithm for approximate flow computations
Proceedings of the 14th international conference on Hybrid systems: computation and control
Fixed point iteration for computing the time elapse operator
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Compositional reachability analysis of genetic networks
CMSB'06 Proceedings of the 2006 international conference on Computational Methods in Systems Biology
Refining the undecidability frontier of hybrid automata
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
In this paper, we suggest a possible confluence of the theory of hybrid automata and the techniques of algorithmic algebra to create a computational basis for systems biology. We describe a method to compute bounded reachability by combining Taylor polynomials and cylindric algebraic decomposition algorithms. We discuss the power and limitations of the framework we propose and we suggest several possible extensions. We briefly show an application to the study of the Delta-Notch protein signaling system in biology.