Probabilistic congruence for semistochastic generative processes

DOI10.1007/978-3-540-31982-5_4MaRDI QIDQ5705909zbMATH OpenOpenAlexFDO

Authors Ruggero Lanotte, Simone Tini

Publication date 10 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106850

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Probabilistic bisimulation as a congruence
• Notes on generative probabilistic bisimulation
• Structural Operational Semantics for Stochastic Process Calculi
• Probabilistic transition system specification: congruence and full abstraction of bisimulation
• A general SOS theory for the specification of probabilistic transition systems

Cited in

(7)

• Semantics and expressiveness of ordered SOS
• A general SOS theory for the specification of probabilistic transition systems
• Notes on generative probabilistic bisimulation
• Rule formats for determinism and idempotence
• SOS rule formats for convex and abstract probabilistic bisimulations
• Logical characterization of bisimulation metrics
• SOS formats and meta-theory: 20 years after

This page was built for publication: Probabilistic congruence for semistochastic generative processes

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