Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. P. Aczel, Non-Well-Founded Sets, CSLI Lecture Notes, No. 14, Stanford University, 1988.
2. P. Aczel and Nax Mendler, A Final Coalgebra Theorem, in Springer Lecture Notes in Computer Science No. 389, Category Theory and Computer Science, edited by D.H. Pitt et al., pp 357–365.
3. J.C.M. Baeten and W.P. Weijland, Process Algebra, Cambridge University Press, 1990.
4. M. Hennessy, Algebraic Theory of Processes, MIT Press, 1988.
5. C.A.R. Hoare, Communicating Sequential Processes, Prentice Hall, 1985.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Wherefore Art Thou $$\ldots $$ Semantics of Computation?;IFIP Advances in Information and Communication Technology;2016
2. From Transitions to Executions;Coalgebraic Methods in Computer Science;2012
3. Towards Bialgebraic Semantics for the Linear Time – Branching Time Spectrum;Recent Trends in Algebraic Development Techniques;2012
4. Weak Bisimilarity Coalgebraically;Algebra and Coalgebra in Computer Science;2009
5. Towards a unified view of bisimulation: a comparative study;Theoretical Computer Science;2000-05