Tuplix Calculus Specifications of Financial Transfer Networks

Abstract

We study the application of Tuplix Calculus in modular financial budget design. We formalize organizational structure using financial transfer networks. We consider the notion of flux of money over a network, and a way to enforce the matching of influx and outflux for parts of a network. We exploit so-called signed attribute notation to make internal streams visible through encapsulations. Finally, we propose a Tuplix Calculus construct for the definition of data functions.

References in corpus (5)

• 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

Cited by in corpus (8)

• Instruction sequences and non-uniform complexity theory
• On the expressiveness of single-pass instruction sequences
• Transmission protocols for instruction streams
• Instruction sequence notations with probabilistic instructions
• A process calculus with finitary comprehended terms
• Meadow enriched ACP process algebras
• Instruction sequences for the production of processes
• A protocol for instruction stream processing