A Stochastic Broadcast Pi-Calculus
Lei Song (IT University of Copenhagen, Denmark), Flemming Nielson, (Technical University of Denmark), Bo Friis Nielsen (Technical University of, Denmark)
TL;DR
This paper introduces a stochastic broadcast Pi-calculus tailored for server-client systems, incorporating immediate transitions and resolving non-determinism to produce valid continuous-time Markov chains, with practical application examples.
Contribution
It presents a novel stochastic broadcast Pi-calculus that models server-client interactions with single-participant synchronization and handles immediate transitions for accurate temporal analysis.
Findings
Successfully models server-client systems with stochastic behaviors.
Provides a method to resolve non-determinism from immediate transitions.
Demonstrates practical applications of the calculus.
Abstract
In this paper we propose a stochastic broadcast PI-calculus which can be used to model server-client based systems where synchronization is always governed by only one participant. Therefore, there is no need to determine the joint synchronization rates. We also take immediate transitions into account which is useful to model behaviors with no impact on the temporal properties of a system. Since immediate transitions may introduce non-determinism, we will show how these non-determinism can be resolved, and as result a valid CTMC will be obtained finally. Also some practical examples are given to show the application of this calculus.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.