Article ID Journal Published Year Pages File Type
10328938 Electronic Notes in Theoretical Computer Science 2005 35 Pages PDF
Abstract
A general and abstract framework to defining congruence formats for various process equivalences is presented. The framework extends bialgebraic techniques of Turi and Plotkin with an abstract coalgebraic approach to process equivalence, based on a notion of test suite. The resulting technique is illustrated on the example of completed trace equivalence. Rather than providing formal proofs, the paper is guiding the reader through the process of deriving a congruence format in the test suite approach.
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
,