¹Information Science and Engineering School, Lanzhou University, Lanzhou 730000, China
²Institute of Basic Research in Clinical Medicine, China Academy of Chinese Medical Sciences, Dongzhimen, Beijing 100700, China
³Guangxi University for Nationalities, China Academy of Chinese Medical Sciences, Nanning, 530004, China
⁴School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China

---

Abstract—Process algebra provides essential tools for studying distributed and concurrent systems. Stochastic process algebra (i.e., 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.

Index Terms—stochastic process algebra, value passing, equivalence, bisimulation, weak time restriction.

[PDF]

Cite: Guang Zheng, Jinzhao Wu, Aiping Lu, "Stochastic Process Algebra with Value-Passing and Weak Time Restrictions," Journal of Software vol. 6, no. 5, pp. 769-782, 2011.