A Complete Axiomatisation for Probabilistic Trace Equivalence

DOI10.7561/SACS.2020.1.69MaRDI QIDQ5089615FDOQ5089615

Authors: Ferry Timmers, Jan Friso Groote 

Publication date: 19 July 2022

Published in: Scientific Annals of Computer Science (Search for Journal in Brave)

Recommendations

• Sound and complete axiomatization of trace semantics for probabilistic systems
• (In)finite trace equivalence of probabilistic transition systems
• Equational axioms for probabilistic bisimilarity
• On the relationship between bisimulation and trace equivalence in an approximate probabilistic context
• Alternative characterizations of probabilistic trace equivalences on coherent resolutions of nondeterminism
• Probabilistic \(\mu\)-calculus: decidability and complete axiomatization
• Constructive Equivalence Relations on Computable Probability Measures
• Constructive equivalence relations on computable probability measures
• scientific article; zbMATH DE number 1754605

zbMATH Keywords

probabilistic processescomplete axiomatisationtrace equivalence

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (2)

• Sound and complete axiomatization of trace semantics for probabilistic systems
• Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?

This page was built for publication: A Complete Axiomatisation for Probabilistic Trace Equivalence

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