Event Abstraction in Modeling Distributed Computations

(Extended abstract of my Master's Thesis.)

A well-known problem in event-based models of distributed computations is the amount and complexity of behavioral information. Event abstraction can be used to reduce the apparent complexity of a computation. Four aspects of event abstraction are studied: a model describing primitive behavior, a formalism for specifying abstract behavior, abstract descriptions of behavior, and verification of primitive or abstract descriptions against specified behavior.

This paper discusses the issues involved in each of these four aspects, presents basic results, and identifies remaining problems.

(postscript / pdf version of the complete paper)

Back to the list of publications.