Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology (Q843992): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Pyhybridanalysis / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MATISSE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: d/dt / 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.1007/s10626-009-0082-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1499482550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algorithmic analysis of hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4806208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combinatorial and algebraic complexity of quantifier elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri net modelling of biological regulatory networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the regularization of Zeno hybrid automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4553263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate simulation relations for hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate bisimulation relations for constrained linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical control system design using approximate simulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of deciding Tarski algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: O-minimal hybrid systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cellular automaton model for neurogenesis in \textit{Drosophila} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3672043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Technology for Verification and Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:58, 2 July 2024

scientific article
Language Label Description Also known as
English
Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology
scientific article

    Statements

    Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology (English)
    0 references
    0 references
    0 references
    0 references
    18 January 2010
    0 references
    hybrid automata
    0 references
    first-order logics
    0 references
    approximate semantics
    0 references
    reachability problem
    0 references
    0 references
    0 references
    0 references

    Identifiers