Instruction sequence notations with probabilistic instructions
arXiv:0906.3083
Abstract
This paper concerns instruction sequences that contain probabilistic instructions, i.e. instructions that are themselves probabilistic by nature. We propose several kinds of probabilistic instructions, provide an informal operational meaning for each of them, and discuss related work. On purpose, we refrain from providing an ad hoc formal meaning for the proposed kinds of instructions. We also discuss the approach of projection semantics, which was introduced in earlier work on instruction sequences, in the light of probabilistic instruction sequences.
15 pages, revised because arxiv:1409.6873v1 [cs.LO] has come out
References in corpus (12)
- Cancellation Meadows: a Generic Basis Theorem and Some Applications
- Instruction sequences with indirect jumps
- Projection semantics for rigid loops
- Thread extraction for polyadic instruction sequences
- Interface groups and financial transfer architectures
- Program algebra with a jump-shift instruction
- Instruction sequences and non-uniform complexity theory
- On the expressiveness of single-pass instruction sequences
- Tuplix Calculus Specifications of Financial Transfer Networks
- An Instruction Sequence Semigroup with Involutive Anti-Automorphisms
- Transmission protocols for instruction streams
- Square root meadows