A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras
Open Access
- 31 October 2002
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 65 (1) , 270-285
- https://doi.org/10.1016/s1571-0661(04)80368-2
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Towards Weak Bisimulation For CoalgebrasElectronic Notes in Theoretical Computer Science, 2002
- Towards coalgebraic behaviourismElectronic Notes in Theoretical Computer Science, 2002
- A Calculus of Terms for Coalgebras of Polynomial FunctorsElectronic Notes in Theoretical Computer Science, 2001
- Semantical Principles in the Modal Logic of CoalgebrasPublished by Springer Nature ,2001
- Coalgebras and Modal LogicElectronic Notes in Theoretical Computer Science, 2000
- A note on Coinduction and Weak Bisimilarity for While ProgramsRAIRO - Theoretical Informatics and Applications, 1999
- Specifying Coalgebras with Modal LogicElectronic Notes in Theoretical Computer Science, 1998
- An approach to object semantics based on terminal co-algebrasMathematical Structures in Computer Science, 1995
- Bounded nondeterminism and the approximation induction principle in process algebraPublished by Springer Nature ,1987
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985