Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Mossakowski, Till
Reichel, Horst
Roggenbach, Markus
and
Schröder, Lutz
2003.
Recent Trends in Algebraic Development Techniques.
Vol. 2755,
Issue. ,
p.
376.
Rothe, Jan
and
Mašulović, Dragan
2003.
Modal Logics for Observation Equivalences.
Electronic Notes in Theoretical Computer Science,
Vol. 82,
Issue. 1,
p.
303.
Lengyel, Florian
2004.
More existence theorems for recursion categories.
Annals of Pure and Applied Logic,
Vol. 125,
Issue. 1-3,
p.
1.
Adámek, Jiřı́
Milius, Stefan
and
Velebil, Jiřı́
2004.
On coalgebra based on classes.
Theoretical Computer Science,
Vol. 316,
Issue. 1-3,
p.
3.
Gumm, H. Peter
2005.
Algebra and Coalgebra in Computer Science.
Vol. 3629,
Issue. ,
p.
194.
Venema, Yde
2007.
Handbook of Modal Logic.
Vol. 3,
Issue. ,
p.
331.
Schwencke, Daniel
2010.
Coequational logic for accessible functors.
Information and Computation,
Vol. 208,
Issue. 12,
p.
1469.
Adamek, J.
Gumm, H. P.
and
Trnkova, V.
2010.
Presentation of Set Functors: A Coalgebraic Perspective.
Journal of Logic and Computation,
Vol. 20,
Issue. 5,
p.
991.
Silva, Alexandra
Bonchi, Filippo
Bonsangue, Marcello
and
Rutten, Jan
2011.
Quantitative Kleene coalgebras.
Information and Computation,
Vol. 209,
Issue. 5,
p.
822.
Padawitz, Peter
2011.
Algebraic Informatics.
Vol. 6742,
Issue. ,
p.
21.
Latella, D.
Massink, M.
and
de Vink, E.P.
2012.
Bisimulation of Labeled State-to-Function Transition Systems of Stochastic Process Languages.
Electronic Proceedings in Theoretical Computer Science,
Vol. 93,
Issue. ,
p.
23.
Neves, Renato
and
Barbosa, Luís S.
2018.
Languages and models for hybrid automata: A coalgebraic perspective.
Theoretical Computer Science,
Vol. 744,
Issue. ,
p.
113.
Gumm, H. Peter
and
Taheri, Mona
2022.
Coalgebraic Methods in Computer Science.
Vol. 13225,
Issue. ,
p.
88.