A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras-Reference-Cited by-同舟云学术

A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras

Published:2002-10 Issue:1 Volume:65 Page:270-285
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Rothe Jan

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference22 articles.

1. R. Goldblatt. A calculus of terms for coalgebras of polynomial functors. In A. Corradini, M. Lenisa, and U. Montanari, editors, Coalgebraic Methods in Computer Science, volume 44 of ENTCS, pages 160–183, April 2001.

2. Birkhoffs variety theorem for coalgebras;Gumm;Contributions to General Algebra,2000

3. Algebraic laws for nondeterminism and concurrency;Hennessy;Journal of the ACM,1985

4. B. Jacobs. The temporal logic of coalgebras via galois algebras. Technical Report CSI-R9906, Computing Science Institute, University of Nijmegen, 1999. To appear in Mathematical Structures in Computer Science.

5. A tutorial on (co)algebras and (co)induction;Jacobs;EATCS Bulletin,1997

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Coalgebras with Internal Moves;Advanced Information Systems Engineering;2014

2. Weak Bisimulations for Coalgebras over Ordered Functors;Lecture Notes in Computer Science;2012

3. New Bisimulation Semantics for Distributed Systems;Lecture Notes in Computer Science;2007

4. Modal Logics for Observation Equivalences;Electronic Notes in Theoretical Computer Science;2003-07

5. Towards Weak Bisimulation For Coalgebras;Electronic Notes in Theoretical Computer Science;2002-11