Parallel Processes with Implicit Computational Capital

Authors:
J. A. Bergstra;C. A. Middelburg
Affiliations:
Programming Research Group, University of Amsterdam, Amsterdam, the Netherlands and Department of Philosophy, Utrecht University, Utrecht, the Netherlands;Programming Research Group, University of Amsterdam, Amsterdam, the Netherlands
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 4
Cited 0

On the consistency of Koomen's fair abstraction rule

Theoretical Computer Science
Algebraic specification

Handbook of theoretical computer science (vol. B)
Branching time and abstraction in bisimulation semantics

Journal of the ACM (JACM)
Model theory for process algebra

Processes, Terms and Cycles

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose a process algebra which is concerned with processes that have an implicit computational capital. This process algebra is intended to be helpful when designing computer-based systems of which the behaviour is related to money handling. It goes along with the development that the behaviour of computer-based systems, organizations and persons is increasingly more related to money handling.