From SOS Specifications to Structured Coalgebras: How to Make Bisimulation a Congruence
Open Access
- 1 January 1999
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 19, 118-141
- https://doi.org/10.1016/s1571-0661(05)80273-7
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A calculus of mobile processes, IPublished by Elsevier ,2004
- Structured Transition Systems as Lax CoalgebrasElectronic Notes in Theoretical Computer Science, 1998
- A 2-categorical presentation of term graph rewritingPublished by Springer Nature ,1997
- A π-calculus with explicit substitutionsTheoretical Computer Science, 1996
- Bisimulation can't be tracedJournal of the ACM, 1995
- Structured operational semantics and bisimulation as a congruenceInformation and Computation, 1992
- An algebraic semantics for structured transition systems and its application to logic programsTheoretical Computer Science, 1992
- The chemical abstract machineTheoretical Computer Science, 1992
- The category of sketches as a model for algebraic semanticsContemporary Mathematics, 1989
- Higher-level synchronising devices in Meije-SCCSTheoretical Computer Science, 1985