Lumpability abstractions of rule-based systems (Q418843): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2011.12.059 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q2754096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic weak simulation is decidable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and ordinary lumpability in finite Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation relations for weighted automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Model Reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rule-Based Modelling, Symmetries, Refinements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rule-Based Modelling of Cellular Signalling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: EQUIVALENCE OF LABELED MARKOV CHAINS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fragments-based Model Reduction: Some Case Studies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sliding Window Abstraction for Infinite Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive Markov chains. And the quest for quantified quality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Compositional Approach to Performance Modelling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3262596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4118602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit theorems for sequences of jump Markov processes approximating ordinary differential processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation through probabilistic testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic approach to chemical kinetics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lumpability and Commutativity of Markov Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite characterization of weak lumpable Markov processes. I: The discrete time case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite characterization of weak lumpable Markov processes. II: The continuous time case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4340161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact Uniformization Method for Computing Transient Distributions of Markov Chains / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2011.12.059 / rank
 
Normal rank

Latest revision as of 17:02, 9 December 2024

scientific article
Language Label Description Also known as
English
Lumpability abstractions of rule-based systems
scientific article

    Statements

    Lumpability abstractions of rule-based systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 May 2012
    0 references
    The goal of this paper is to speed up the analysis of complicated networks of chemical reactions in molecular biology. For instance, the speed of one reaction occurring at one end of a big molecule may be independent of whether another reaction at the opposite end of the molecule has occurred. This paper exploits such situations by splitting a stochastic model of a biomolecular system into equivalence classes and performing the analysis on the resulting quotient model instead of the original model. After discussing the motivation, the paper illustrates the main biomolecular concepts and shows how they map to weighted labelled transition systems (WLTS) and their trace density semantics. Then it presents a language called Kappa for representing dynamic stochastic biomolecular systems. A Kappa agent represents a molecule or sub-molecule in some form that it can be transformed to (e.g., bound or not bound to another sub-molecule). A Kappa mixture is a multiset of agents satisfying some well-formedness conditions. A Kappa system consists of a set of Kappa rules and a probability distribution on an abstracted mixture (the initial distribution). The abstraction only removes syntactical differences. The evolution of a Kappa system is determined by the rules and induces a WLTS. The paper continues by defining the equivalence used in computing the quotient model. Then it recalls and slightly develops concepts and results from Markov chain and WLTS literature, and cites a result (proven elsewhere) that they can be applied to Kappa systems.
    0 references
    0 references
    Markov chains
    0 references
    molecular biology
    0 references
    weighed labelled transition system
    0 references
    lumpability
    0 references
    bisimulation
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references