A unification of probabilistic choice within a design-based model of reversible computation

DOI10.1007/s00165-007-0048-1zbMath1259.68037OpenAlexW2073540007MaRDI QIDQ1941891

Frank Zeyda, Bill Stoddart

Publication date: 22 March 2013

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://research.tees.ac.uk/en/publications/d3e25002-173f-4330-b449-df83e02ee520

zbMATH Keywords

probabilitybacktrackingreversible computingbunchesHoare-He designs

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Integrating stochastic reasoning into Event-B development

Cites Work

• Unnamed Item
• Bunch theory: A simple set theory for computer science
• Probabilistic models for the guarded command language
• Irreversibility and Heat Generation in the Computing Process
• Abstraction, Refinement and Proof for Probabilistic Systems
• The specification statement
• A Design-Based Model of Reversible Computation
• Unifying Probability
• Distributing probability over non-determinism
• Nondeterministic Algorithms
• Logical Reversibility of Computation
• ZB 2005: Formal Specification and Development in Z and B

This page was built for publication: A unification of probabilistic choice within a design-based model of reversible computation