A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Using Net Refinement to Compute the Fixpoint of a Recursive Expression
1995
Electronical Notes in Theoretical Computer Science
The talk illustrates the general Petri net semantics of equations such a s X = term(X) using a basic CCS-like process algebra without restriction, synchronisation and relabelling.
doi:10.1016/s1571-0661(05)80177-x
fatcat:kveh3bh2n5hvrjwz62mrtyryn4