Peter G. Harrison, Ben Strulo
We present a process algebra or programming language, based on CCS, which may be used to describe discrete event simulations with parallelism. It has extensions to describe the passing of time and probabilistic choice, either discrete, between a countable number of processes, or continuous to choose a random amount of time to wait. It has a clear operational semantics and we give approaches to denotational semantics given in terms of an algebra of equivalences over processes. It raises questions about when two simulations are equivalent and what we mean by non-determinism in the context of the specication of a simulation. It also exemplies some current approaches to adding time and probability to process algebras.
Information from pubs.doc.ic.ac.uk/spades-qmips-93.