Let's PARTY: Process Algebra With Real-time From York
Chris Ho-Stuart, Ming Fang, H.S.M. Zedan · 1992
There are many real-time process algebras, but they invariably make restrictive assumptions about representable behavior, or do not have proof theory for a suitably large class of behaviours. We introduce the Process Algebra with Real-Time from York (PARTY), which uses a simple yet powerful, intuitive and general model of real-time behavior. A real-time process interacts with its environment by instantaneous actions. There is no restriction on the tame between successive events, and internal action is hidden. The equivalence of recursively defined finite state processes is decidable, and a program has been written. for analyzing PARTY processes.