scientific article; zbMATH DE number 4115933

zbMATH Open0681.68027MaRDI QIDQ4730757FDOQ4730757

Authors: Bard Bloom, Albert R. Meyer 

Publication date: 1989

Title of this publication is not available (Why is that?)

Recommendations

• Bisimulation and Simulation Relations for Markov Chains
• Bisimulation through probabilistic testing
• Bisimulations for probabilistic and quantum processes (invited paper)
• Exploring probabilistic bisimulations. I
• Bisimulation for labelled Markov processes

zbMATH Keywords

computabilityBisimulation

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cited In (11)

• Algebraic theory of probabilistic and nondeterministic processes.
• Testing preorders for probabilistic processes
• Bisimulation through probabilistic testing
• Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
• Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving
• Monoidal streams for dataflow programming
• On the probabilistic bisimulation spectrum with silent moves
• Experimenting with process equivalence
• Bisimulations for probabilistic and quantum processes (invited paper)
• Theoretical Aspects of Computing – ICTAC 2005
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4730757)