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
Biochemistry, molecular biology (92C40) Specification and verification (program logics, model checking, etc.) (68Q60) General biology and biomathematics (92B05)
Cited In (6)
- 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
- Hybrid automata, reachability, and systems biology
- Title not available (Why is that?)
- Hybrid Automata in Systems Biology: How Far Can We Go?
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- On an equivalence checking technique for algebraic models of programs 👍 👎
- Title not available (Why is that?) 👍 👎
- Perspectives of System Informatics 👍 👎
- Improved Algorithms for the Automata-Based Approach to Model-Checking 👍 👎
- Computer Aided Verification 👍 👎
- 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 👍 👎
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)
