论文信息 - A complete axiom system for finite-state probabilistic processes

A complete axiom system for finite-state probabilistic processes

A complete equational axiomatization of probabilistic bisimulation for nite-state probabilistic processes is presented. It extends Milner's complete axiomatiza

Scott A. Smolka | Eugene W. Stark | E. W. Stark | S. Smolka

[1] Robin Milner,et al. A Complete Axiomatisation for Observational Congruence of Finite-State Behaviors , 1989, Inf. Comput..

[2] Kim G. Larsen,et al. Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[3] Jan A. Bergstra,et al. Axiomatizing Probabilistic Processes: ACP with Generative Probabilities , 1995, Inf. Comput..

[4] Jan A. Bergstra,et al. Process Algebra for Synchronous Communication , 1984, Inf. Control..

[5] Chi-Chang Jou. Aspects of probabilistic process algebra , 1992 .

[6] Robin Milner,et al. A Complete Inference System for a Class of Regular Behaviours , 1984, J. Comput. Syst. Sci..

[7] Bernhard Steffen,et al. Reactive, generative, and stratified models of probabilistic processes , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.