An algebraic treatment of recursion
Authors
DATA61
UNSW Sydney
Abstract
I review the three principal methods to assign meaning to recursion in process algebra: the denotational, the operational and the algebraic approach, and I extend the latter to unguarded recursion.
BibTeX Entry
@inbook{vanGlabbeek_16, author = {van Glabbeek, Rob}, editor = {{Alban Ponse, Inge Bethke \& Bert Bredeweg}}, month = dec, date = {2016-12-14}, year = {2016}, keywords = {Process algebra Recursion Algebraic semantics Denotational semantics Operational semantics}, title = {An Algebraic Treatment of Recursion}, address = {Uppsala, Sweden}, pages = {58-59}, booktitle = {Liber Amicorum for Jan Bergstra}, paperurl = {https://ts.data61.csiro.au/publications/csiro_full_text//vanGlabbeek_16.pdf}, publisher = {University of Amsterdam} }