Hybrid automata, reachability, and systems biology (Q969180): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: HyTech / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.12.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034963384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: O-minimal hybrid systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: HyTech: A model checker for hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4806208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting connected components of a semialgebraic set in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: QEPCAD B / rank
 
Normal rank
Property / cites work
 
Property / cites work: Taylor approximation for hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Technology for Verification and Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2852017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient solving of quantified inequality constraints over the real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Automata in Systems Biology: How Far Can We Go? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Systems: Computation and Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling biological systems in stochastic concurrent constraint programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736610 / rank
 
Normal rank

Latest revision as of 20:28, 2 July 2024

scientific article
Language Label Description Also known as
English
Hybrid automata, reachability, and systems biology
scientific article

    Statements

    Hybrid automata, reachability, and systems biology (English)
    0 references
    0 references
    0 references
    11 May 2010
    0 references
    0 references
    semi-algebraic automata
    0 references
    reachability
    0 references
    systems biology
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references