Probabilistic Branching in Markovian Process Algebras | Zendy

M. Rettelbach | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Probabilistic Branching in Markovian Process Algebras

Author(s) -

M. Rettelbach

Publication year - 1995

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/38.7.590

Subject(s) - probabilistic logic , branching (polymer chemistry) , branching process , markov process , computer science , stochastic process , process calculus , statistical physics , extension (predicate logic) , mathematics , process (computing) , algebra over a field , theoretical computer science , pure mathematics , artificial intelligence , combinatorics , physics , statistics , programming language , materials science , composite material

We introduce immediate transitions as an extension of Stochastic Process Algebras (SPA). We distinguish two different classes of immediate transitions: probabilistic branching and management activities. We discuss both approaches and develop a theory for the probabilistic branching case. Although we use TIPP as a sample language within this paper, the theory can easily be adapted to other Stochastic Process Algebras and can therefore be seen as a general result for probabilistic branching in SPA.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research