Structured Transition Systems as Lax Coalgebras
Open Access
- 31 December 1998
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 11, 22-41
- https://doi.org/10.1016/s1571-0661(04)00051-9
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- An inductive view of graph transformationPublished by Springer Nature ,1998
- A 2-categorical presentation of term graph rewritingPublished by Springer Nature ,1997
- A categorical model for logic programs: Indexed monoidal categoriesPublished by Springer Nature ,1993
- An algebraic semantics for structured transition systems and its application to logic programsTheoretical Computer Science, 1992
- Dynamic Congruence vs. Progressing Bisimulation for CCS1Fundamenta Informaticae, 1992
- Petri nets are monoidsInformation and Computation, 1990
- A Calculus of Communicating SystemsLecture Notes in Computer Science, 1980
- Formal verification of parallel programsCommunications of the ACM, 1976
- Adjoint Lifting Theorems for Categories of AlgebrasBulletin of the London Mathematical Society, 1975
- Categories for the Working MathematicianPublished by Springer Nature ,1971