Computing Publications

Publications Home » SPADES - a Process Algebra for Di...

SPADES - a Process Algebra for Discrete Event Simulation

Peter G. Harrison, Ben Strulo

Journal Article
Journal of Logic and Computation
Volume 10
Issue 1
pp.3–42
January, 2000
Oxford University Press
DOI 10.1093/logcom/10.1.3
Abstract

We present a process algebra, SPADES, based on Milner's CCS, which may be used to describe discrete event simulations with parallelism. It is able 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. Its operational semantics is presented as a labelled transition system and we discuss equivalences over this operational semantics that imply axioms that can be used to compare and transform processes formally. We discuss notions of equivalence over simulations and the meaning of non-determinism in the context of the specification of a simulation. The algebra is applied to describe quantitatively a range of communicating systems.

Keywords
AESOP
PDF of full publication (589 kilobytes)
(need help viewing PDF files?)
Postscript of full publication (388 kilobytes)
(need help viewing Postscript files?)
BibTEX file for the publication
N.B.
Conditions for downloading publications from this site.
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.