[go: up one dir, main page]

Paulevé, 2017 - Google Patents

Reduction of qualitative models of biological networks for transient dynamics analysis

Paulevé, 2017

View PDF
Document ID
12761075178328039276
Author
Paulevé L
Publication year
Publication venue
IEEE/ACM transactions on computational biology and bioinformatics

External Links

Snippet

Qualitative models of dynamics of signalling pathways and gene regulatory networks allow for the capturing of temporal properties of biological networks while requiring few parameters. However, these discrete models typically suffer from the so-called state space …
Continue reading at hal.science (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G06F17/504—Formal methods
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30386—Retrieval requests
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5045—Circuit design
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/36—Preventing errors by testing or debugging software
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/40—Transformations of program code
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
    • G06F19/10—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2217/00—Indexing scheme relating to computer aided design [CAD]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/02—Knowledge representation
    • G06N5/022—Knowledge engineering, knowledge acquisition
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass

Similar Documents

Publication Publication Date Title
Paulevé Reduction of qualitative models of biological networks for transient dynamics analysis
Alur et al. Search-based program synthesis
Alur Formal verification of hybrid systems
Clarke et al. Model checking: algorithmic verification and debugging
Dávid et al. Foundations for streaming model transformations by complex event processing
Duo et al. A deadlock prevention policy for a class of multithreaded software
Hartonas-Garmhausen et al. Verification of a safety-critical railway interlocking system with real-time constraints
Paulevé Goal-oriented reduction of automata networks
Preoteasa et al. Towards compositional feedback in non-deterministic and non-input-receptive systems
Teodorov et al. Environment-driven reachability for timed systems: safety verification of an aircraft landing gear system
Ben-Amram et al. Complexity of Bradley-Manna-Sipma lexicographic ranking functions
Teodorov et al. Past‐Free [ze] reachability analysis: reaching further with DAG‐directed exhaustive state‐space analysis
Falk et al. A rule-based quasi-static scheduling approach for static islands in dynamic dataflow graphs
Jensen et al. Integrating tools: Co-simulation in uppaal using fmi-fmu
Zebelein et al. Classification of general data flow actors into known models of computation
Armstrong et al. Algebras for program correctness in Isabelle/HOL
Stanley et al. SAT-based control of concurrent software for deadlock avoidance
Knapik et al. Action synthesis for branching time logic: Theory and applications
Hulst et al. Maximal synthesis for Hennessy-Milner logic
Mishchenko et al. Efficient solution of language equations using partitioned representations
Dixit et al. Time-budgeting: a component based development methodology for real-time embedded systems
Kazmierczak et al. Verifying requirements through mathematical modelling and animation
Arcaini et al. Improving model-based test generation by model decomposition
Mendias et al. Efficient verification of scheduling, allocation and binding in high-level synthesis
Otpuschennikov et al. Transalg: a tool for translating procedural descriptions of discrete functions to SAT (tool paper)