Publication

Formalisms for Specifying Markovian Population Models

Barbara Jobstmann, Verena Wolf
2009
Conference Papers

Abstract

We compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. These languages -matrix descriptions, stochastic Petri nets, stoichiometric equations, stochastic process algebras, and guarded command models- all describe continuous-time Markov chains, but they differ according to important properties, such as compositionality, expressiveness; and succinctness, executability, ease of use, and the support they provide for checking the well-formedness of a model and for analyzing a model.

Official source

https://infoscience.epfl.ch/entities/publication/b03ca1d1-cc23-45c4-aa7a-bc611373f42e

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Barbara Jobstmann, Verena Wolf
2009
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/b03ca1d1-cc23-45c4-aa7a-bc611373f42e

About this result

Related concepts (27)

Stoichiometry

Stoichiometry (ˌstɔɪkiˈɒmᵻtri) is the relationship between the quantities of reactants and products before, during, and following chemical reactions. Stoichiometry is founded on the law of conservation of mass where the total mass of the reactants equals the total mass of the products, leading to the insight that the relations among quantities of reactants and products typically form a ratio of positive integers. This means that ,if the amounts of the separate reactants are known, then the amount of the product can be calculated.

Markov chain

A Markov chain or Markov process is a stochastic model describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event. Informally, this may be thought of as, "What happens next depends only on the state of affairs now." A countably infinite sequence, in which the chain moves state at discrete time steps, gives a discrete-time Markov chain (DTMC). A continuous-time process is called a continuous-time Markov chain (CTMC).

Rate equation

In chemistry, the rate law or rate equation for a chemical reaction is a mathematical equation that links the rate of forward reaction with the concentrations or pressures of the reactants and constant parameters (normally rate coefficients and partial reaction orders). For many reactions, the initial rate is given by a power law such as where [\mathrm{A}] and [\mathrm{B}] express the concentration of the species \mathrm{A} and \mathrm{B}, usually in moles per liter (molarity, M).

Related publications (31)

SPEEDING UP KRYLOV SUBSPACE METHODS FOR COMPUTING f(A)b VIA RANDOMIZATION

Daniel Kressner, Alice Cortinovis

This work is concerned with the computation of the action of a matrix function f(A), such as the matrix exponential or the matrix square root, on a vector b. For a general matrix A, this can be done by computing the compression of A onto a suitable Krylov ...

Siam Publications2024

Randomized low-rank approximation and its applications

Ulf David Persson

In this thesis we will present and analyze randomized algorithms for numerical linear algebra problems. An important theme in this thesis is randomized low-rank approximation. In particular, we will study randomized low-rank approximation of matrix functio ...

EPFL2024

Accelerator-driven Data Arrangement to Minimize Transformers Run-time on Multi-core Architectures

David Atienza Alonso, Giovanni Ansaloni, Alireza Amirshahi

The increasing complexity of transformer models in artificial intelligence expands their computational costs, memory usage, and energy consumption. Hardware acceleration tackles the ensuing challenges by designing processors and accelerators tailored for t ...

2024