TU Darmstadt / ULB / TUbiblio

Stochastic Semantics of Signaling as a Composition of Agent-view Automata

Koeppl, H. ; Petrov, T. (2011)
Stochastic Semantics of Signaling as a Composition of Agent-view Automata.
In: Electronic Notes in Theoretical Computer Science, 272
doi: 10.1016/j.entcs.2011.04.002
Artikel, Bibliographie

Dies ist die neueste Version dieses Eintrags.

Kurzbeschreibung (Abstract)

In this paper we present a formalism based on stochastic automata to describe the stochastic dynamics of signal transduction networks that are specified by rule-sets. Our formalism gives a modular description of the underlying stochastic process, in the sense that it is a composition of smaller units, agent-views. The view of an agent is an automaton that identifies all local modification changes of that agent (internal state modifications, binding and unbinding), but also those of interacting agents, which are tested within the same rule. We show how to represent the generator matrix of the underlying Markov process of the whole rule-set as Kronecker sums of the rate matrices belonging to individual view-automata. In the absence of birth the automata are finite, since the number of different contexts in which one agent can appear in a rule-set is finite. We illustrate the framework by an example that is related to cellular signaling events. © 2011 Elsevier B.V. All rights reserved.

Typ des Eintrags: Artikel
Erschienen: 2011
Autor(en): Koeppl, H. ; Petrov, T.
Art des Eintrags: Bibliographie
Titel: Stochastic Semantics of Signaling as a Composition of Agent-view Automata
Sprache: Englisch
Publikationsjahr: Mai 2011
Verlag: Elsevier
Titel der Zeitschrift, Zeitung oder Schriftenreihe: Electronic Notes in Theoretical Computer Science
Jahrgang/Volume einer Zeitschrift: 272
DOI: 10.1016/j.entcs.2011.04.002
URL / URN: http://linkinghub.elsevier.com/retrieve/pii/S157106611100069...
Zugehörige Links:
Kurzbeschreibung (Abstract):

In this paper we present a formalism based on stochastic automata to describe the stochastic dynamics of signal transduction networks that are specified by rule-sets. Our formalism gives a modular description of the underlying stochastic process, in the sense that it is a composition of smaller units, agent-views. The view of an agent is an automaton that identifies all local modification changes of that agent (internal state modifications, binding and unbinding), but also those of interacting agents, which are tested within the same rule. We show how to represent the generator matrix of the underlying Markov process of the whole rule-set as Kronecker sums of the rate matrices belonging to individual view-automata. In the absence of birth the automata are finite, since the number of different contexts in which one agent can appear in a rule-set is finite. We illustrate the framework by an example that is related to cellular signaling events. © 2011 Elsevier B.V. All rights reserved.

Freie Schlagworte: Cell signaling,Continuous-time Markov chain,Stochastic automata composition
Fachbereich(e)/-gebiet(e): 18 Fachbereich Elektrotechnik und Informationstechnik
18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Nachrichtentechnik > Bioinspirierte Kommunikationssysteme
18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Nachrichtentechnik
Hinterlegungsdatum: 04 Apr 2014 12:27
Letzte Änderung: 13 Mai 2024 09:51
PPN:
Export:
Suche nach Titel in: TUfind oder in Google

Verfügbare Versionen dieses Eintrags

Frage zum Eintrag Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen