A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Algebraic theory of processes
Process algebra
Bisimulation through probabilistic testing
Information and Computation
Journal of the ACM (JACM)
Communication and concurrency
A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Handbook of Process Algebra
An Asynchronous Algebra with Multiple Clocks
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Precongruence formats for decorated trace semantics
ACM Transactions on Computational Logic (TOCL)
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
Bialgebraic Methods in Structural Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
The microcosm principle and concurrency in coalgebra
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
| Hi-index | 0.00 |
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.