Bisimulation through probabilistic testing
Information and Computation
Relational methods in computer science
Relational methods in computer science
Refinement and demonic semantics
Relational methods in computer science
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Bisimulation for probabilistic transition systems: a coalgebraic approach
Bisimulation for probabilistic transition systems: a coalgebraic approach
Universal coalgebra: a theory of systems
Universal coalgebra: a theory of systems
Possibilistic and Probabilistic Abstraction-Based Model Checking
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Tracing Relations Probabilistically
Fundamenta Informaticae
Tracing Relations Probabilistically
Fundamenta Informaticae
The converse of a stochastic relation
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Semi-pullbacks and bisimulations in categories of stochastic relations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Tracing Relations Probabilistically
Fundamenta Informaticae
Tracing Relations Probabilistically
Fundamenta Informaticae
| Hi-index | 0.00 |
The demonic product of two probabilistic relations is defined and investigated. It is shown that the product is stable under bisimulations when the mediating object is probabilistic,and that under some mild conditions the non-deterministic fringe of the probabilistic relations behaves properly: the fringe of the product equals the demonic product of the fringes.