Year: 2025
Type: article
Abstract: This paper shows that guarded systems of recursive equations have unique solutions up to strong bisimilarity for any process algebra with a structural operation semantics in the ready simulation format.A similar result holds for simulation equivalence, for ready simulation equivalence and for the (ready) simulation preorder.As a consequence, these equivalences and preorders are full (pre) congruences for guarded recursion.Moreover, the unique-solutions result yields a sound and groundcomplete axiomatisation of strong bisimilarity for any finitary GSOS language.
DOI: 10.4204/eptcs.433.6
Author: Rob van Glabbeek
Institutions: UNSW Sydney, University of Edinburgh
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W7101417980
FWCI:
Cites:
Cited by:
Related to: