Process algebra
Bisimulation through probabilistic testing
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Structural operational semantics for weak bisimulations
Theoretical Computer Science
Axiomatizing probabilistic processes: ACP with generative probabilities
Information and Computation
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Rooted branching bisimulation as a congruence
Journal of Computer and System Sciences
A complete axiom system for finite-state probabilistic processes
Proof, language, and interaction
Communication and Concurrency
Discrete time generative-reactive probabilistic processes with different advancing speeds
Theoretical Computer Science
Testing Preorders for Probabilistic Processes
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Testing Equivalences and Fully Abstract Models for Probabilistic Processes
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
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
A process-algebraic approach for the analysis of probabilistic noninterference
Journal of Computer Security
Divide and congruence: from decomposition of modalities to preservation of branching bisimulation
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Probabilistic congruence for semistochastic generative processes
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Axiomatizations for probabilistic finite-state behaviors
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
On cool congruence formats for weak bisimulations
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Compositional reasoning for probabilistic finite-state behaviors
Processes, Terms and Cycles
| Hi-index | 0.00 |
In this notes we consider the model of Generative Probabilistic Transition Systems, and Baier and Hermanns' notion of weak bisimulation defined over them. We prove that, if we consider any process algebra giving rise to a Probabilistic Transition System satisfying the condition of regularity and offering prefixing, interleaving, and guarded recursion, then the coarsest congruence that is contained in weak bisimulation is strong bisimulation.