Algorithmic algebraic model checking. III: Approximate methods
From MaRDI portal
Publication:2852017
zbMATH Open1273.68239MaRDI QIDQ2852017FDOQ2852017
Venkatesh P. Mysore, Bud Mishra
Publication date: 7 October 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066106000545
Recommendations
- scientific article; zbMATH DE number 5181785
- scientific article; zbMATH DE number 2086974
- On an equivalence checking technique for algebraic models of programs
- scientific article; zbMATH DE number 1759713
- Polynomial approximations for model checking
- Improved Algorithms for the Automata-Based Approach to Model-Checking
- Algorithmic improvements in regular model checking.
- Algebraic model checking for discrete linear dynamical systems
- Automated Technology for Verification and Analysis
- On the polynomial complexity of the equivalence checking problem in algebraic models of programs
Biochemistry, molecular biology (92C40) Specification and verification (program logics, model checking, etc.) (68Q60) General biology and biomathematics (92B05)
Cited In (9)
- Computer Aided Verification
- Algorithmic Algebraic Model Checking IV: Characterization of Metabolic Networks
- Taylor approximation for hybrid systems
- Correctness criteria for algebraic closures of the estimate-calculating algorithm model
- Low dimensional hybrid systems -- decidable, undecidable, don't know
- Automated Technology for Verification and Analysis
- Hybrid automata, reachability, and systems biology
- Title not available (Why is that?)
- Hybrid Automata in Systems Biology: How Far Can We Go?
This page was built for publication: Algorithmic algebraic model checking. III: Approximate methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2852017)
