Using Net Refinement to Compute the Fixpoint of a Recursive Expression

The talk illustrates the general Petri net semantics of equations such as X = term(X) using a basic CCS-like process algebra without restriction, synchronisation and relabelling.