A theory of stochastic systems part I: Stochastic automata

P.R. d' Argenio; Joost P. Katoen

doi:10.1016/j.ic.2005.07.001

A theory of stochastic systems part I: Stochastic automata

P.R. d' Argenio, Joost P. Katoen

Research output: Contribution to journal › Article › Academic › peer-review

51 Citations (Scopus)

108 Downloads (Pure)

Abstract

This paper presents the theoretical underpinning of a model for symbolically representing probabilistic transition systems, an extension of labelled transition systems for the modelling of general (discrete as well as continuous or singular) probability spaces. These transition systems are particularly suited for modelling softly timed systems, real-time systems in which the time constraints are of random nature. For continuous probability spaces these transition systems are infinite by nature. Stochastic automata represent their behaviour in a finite way. This paper presents the model of stochastic automata, their semantics in terms of probabilistic transition systems, and studies several notions of bisimulation. Furthermore, the relationship of stochastic automata to generalised semi-Markov processes is established.

Original language	English
Pages (from-to)	1-38
Number of pages	38
Journal	Information and computation
Volume	203
Issue number	1
DOIs	https://doi.org/10.1016/j.ic.2005.07.001
Publication status	Published - 2005

Access to Document

10.1016/j.ic.2005.07.001

theory__pt._IFinal published version, 531 KB

Cite this

@article{8e44c1544b1047cd80f24ea80f76d231,

title = "A theory of stochastic systems part I: Stochastic automata",

abstract = "This paper presents the theoretical underpinning of a model for symbolically representing probabilistic transition systems, an extension of labelled transition systems for the modelling of general (discrete as well as continuous or singular) probability spaces. These transition systems are particularly suited for modelling softly timed systems, real-time systems in which the time constraints are of random nature. For continuous probability spaces these transition systems are infinite by nature. Stochastic automata represent their behaviour in a finite way. This paper presents the model of stochastic automata, their semantics in terms of probabilistic transition systems, and studies several notions of bisimulation. Furthermore, the relationship of stochastic automata to generalised semi-Markov processes is established.",

author = "{d' Argenio}, P.R. and Katoen, {Joost P.}",

year = "2005",

doi = "10.1016/j.ic.2005.07.001",

language = "English",

volume = "203",

pages = "1--38",

journal = "Information and computation",

issn = "0890-5401",

publisher = "Academic Press",

number = "1",

}

TY - JOUR

T1 - A theory of stochastic systems part I: Stochastic automata

AU - d' Argenio, P.R.

AU - Katoen, Joost P.

PY - 2005

Y1 - 2005

N2 - This paper presents the theoretical underpinning of a model for symbolically representing probabilistic transition systems, an extension of labelled transition systems for the modelling of general (discrete as well as continuous or singular) probability spaces. These transition systems are particularly suited for modelling softly timed systems, real-time systems in which the time constraints are of random nature. For continuous probability spaces these transition systems are infinite by nature. Stochastic automata represent their behaviour in a finite way. This paper presents the model of stochastic automata, their semantics in terms of probabilistic transition systems, and studies several notions of bisimulation. Furthermore, the relationship of stochastic automata to generalised semi-Markov processes is established.

AB - This paper presents the theoretical underpinning of a model for symbolically representing probabilistic transition systems, an extension of labelled transition systems for the modelling of general (discrete as well as continuous or singular) probability spaces. These transition systems are particularly suited for modelling softly timed systems, real-time systems in which the time constraints are of random nature. For continuous probability spaces these transition systems are infinite by nature. Stochastic automata represent their behaviour in a finite way. This paper presents the model of stochastic automata, their semantics in terms of probabilistic transition systems, and studies several notions of bisimulation. Furthermore, the relationship of stochastic automata to generalised semi-Markov processes is established.

U2 - 10.1016/j.ic.2005.07.001

DO - 10.1016/j.ic.2005.07.001

M3 - Article

SN - 0890-5401

VL - 203

SP - 1

EP - 38

JO - Information and computation

JF - Information and computation

IS - 1

ER -

A theory of stochastic systems part I: Stochastic automata

Abstract

Access to Document

Fingerprint

Cite this