Stochastic Process Algebra with Value-Passing and Weak Time Restrictions

Abstract

Process algebra provides essential tools for studying distributed and concurrent systems. Stochastic process algebra (i.e., $\mathcal{YAWN}$) enhances the process algebra with stochastic extensions which is perfect to analyze phenomena of process with executing durations in the real world. What's more, in system runs, value passing is tightly bounded with their processes. However, stochastic process algebras lack value passing can limit their expressiveness. Based on this, we propose a process algebra of stochastic process algebra with value passing. This new process algebra can specify the behaviors of systems in a more clear and accurate way. In dealing with relationship of bisimulations, we introduce a new policy of weak time comparison between processes in bisimulation which is more convenient and doable in practice.