Bisimulation through probabilistic testing
Information and Computation
Structured operational semantics and bisimulation as a congruence
Information and Computation
Transition system specifications with negative premises
Theoretical Computer Science
Journal of the ACM (JACM)
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Axiomatizing probabilistic processes: ACP with generative probabilities
Information and Computation
Ntyft/ntyxt rules reduce to ntree rules
Information and Computation
The meaning of negative premises in transition system specifications
Journal of the ACM (JACM)
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
A general conservative extension theorem in process algebras with inequalities
ACP '95 Proceedings from the international workshop on Algebra of communicating processes
Conservative extension in structural operational semantics
Current trends in theoretical computer science
Communication and Concurrency
Process Algebra with a Zero Object
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
Probabilistic bisimulation as a congruence
ACM Transactions on Computational Logic (TOCL)
Probabilistic congruence for semistochastic generative processes
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Compositionality of probabilistic Hennessy-Milner logic through structural operational semantics
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.00 |
We present a format for the specification of probabilistic transition systems that guarantees that bisimulation equivalence is a congruence for any operator defined in this format. In this sense, the format is somehow comparable to the ntyft/ntyxt format in a non-probabilistic setting. We also study the modular construction of probabilistic transition systems specifications and prove that some standard conservative extension theorems also hold in our setting. Finally, we show that the trace congruence for image-finite processes induced by our format is precisely bisimulation on probabilistic systems.