A Calculus Based on Absence of Actions
Padmanabhan Krishnan
Department of Computer Science
University of Canterbury
Abstract
In this article we present a process algebra where the behaviour can be specified when certain actions cannot be exhibited. This is useful in specifying time outs, interrupts etc. We present a few properties which form the basis for a sound and complete axiomatisation of a bisimulation equivalence relation. A comparison with other approaches is presented.