Abstract
Many process algebras are defined by structural operational semantics (SOS). Indeed, most such definitions are nicely structured and fit the GSOS format of Bloom et al. (J. Assoc. Comput. Mach., to appear). We give a procedure for converting any GSOS language definition to a finite complete equational axiom system (possibly with one infinitary induction principle) which precisely characterizes strong bisimulation of processes. © 1994 Academic Press, Inc.
Cite
CITATION STYLE
Aceto, L., Bloom, B., & Vaandrager, F. (1994). Turning sos rules into equations. Information and Computation, 111(1), 1–52. https://doi.org/10.1006/inco.1994.1040
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.