Communicating sequential processes
Communicating sequential processes
Artificial Intelligence
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Communication and concurrency
A new approach for fuzzy topology (I)
Fuzzy Sets and Systems
Testing equivalences and fully abstract models for probabilistic processes
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Equivalences, congruences, and complete axiomatizations for probabilistic processes
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Priority as extremal probability
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
An efficient global convergence detection scheme for parallel algorithms on transputer networks
OUG-12 Proceedings of the 12th Occam User Group technical meeting on Tools and techniques for transputer applications
A synchronous calculus of relative frequency
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Bisimulation through probabilistic testing
Information and Computation
A new approach for fuzzy topology (II)
Fuzzy Sets and Systems
A new approach for fuzzy topology (III)
Fuzzy Sets and Systems
Fuzzifying topology based on complete residuated lattice-valued logic (I)
Fuzzy Sets and Systems
A theory of communicating processes with value passing
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Probabilistic communicating processes
Theoretical Computer Science
Axiomatizing probabilistic processes: ACP with generative probabilities
Information and Computation
Composition and behaviors of probabilistic I/O automata
Theoretical Computer Science
Testing preorders for probabilistic processes
Information and Computation
Communicating sequential processes
Communications of the ACM
Formal verification of parallel programs
Communications of the ACM
Topology in process calculus: approximate correctness and infinite evolution of concurrent programs
Topology in process calculus: approximate correctness and infinite evolution of concurrent programs
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Bisimulation indexes and their applications
Theoretical Computer Science
Testing Probabilistic and Nondeterministic Processes
Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
Testing Preorders for Probabilistic Processes
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Compositional Verification of Probabilistic Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Polynomial Time Algorithms for Testing Probabilistic Bisimulation and Simulation
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Weak Bisimulation for Fully Probabilistic Processes
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Compositional Testing Preorders for Probabilistic Processes
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Probabilistic bisimulations for quantum processes
Information and Computation
| Hi-index | 5.23 |
We propose a new model of probabilistic processes. In this model, a probability is assigned to the action of a prefix and a probability distribution is assigned to the components of a parallel composition. In addition, the probability of a transition of a probabilistic summation is evaluated as the sum of the probabilities of the same transition of summands multiplied by the probabilities associated to them in the summation. The concepts of strong bisimulation degree and (weak) bisimulation degree are introduced. These notions provide us with continuous spectra of strong bisimilarities, (weak) bisimilarities and observation congruences which equate probabilistic processes with different degrees of belief. Various equational laws of probabilistic processes with respect to these equivalence relations are presented and substitutivities of these equivalence relations under various combinators are established.