Process Algebraic Non-product-forms | Zendy

Peter G. Harrison | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Process Algebraic Non-product-forms

Author(s) -

Peter G. Harrison

Publication year - 2006

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2006.03.012

Subject(s) - generalization , process calculus , separable space , queueing theory , product (mathematics) , markov process , class (philosophy) , algebraic number , computer science , process (computing) , state space , algebra over a field , mathematics , theoretical computer science , discrete mathematics , pure mathematics , artificial intelligence , mathematical analysis , computer network , statistics , geometry , operating system

A generalization of the Reversed Compound Agent Theorem of Markovian process algebra is derived that yields separable, but non-product-form solutions for collections of interacting processes such as arise in multi-class queueing networks with Processor Sharing servers. It is based on an analysis of the minimal cycles in the state space of a multi-agent cooperation, which can be simply identified. The extended methodology leads to what we believe are new separable solutions and, more generally, the results represent a viable practical application of the theory of Markovian process algebras in stochastic modelling

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