Abstract
The Stochastic Process Algebra (SPA) formalism for performance models of communicating systems is briefly reviewed, focussing on the subset of Markovian Process Algebra (MPA). MPA facilitates analytical solutions for equilibrium state probabilities, in principle, but direct methods are severely limited by the size of the state space. By considering the reversed process of a stationary Markov chain, product-forms are derived for the equilibrium state probabilities in stochastic networks defined by a collection of cooperating MPA agents. Key to the analysis is the property of compositionality. Under quite general conditions, the well known product-forms for networks of queues (Jackson’s theorem) and G-networks (with both positive and negative customers) can be simply obtained. Two new product forms are also derived by systematically following this mechanical approach.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
