Fixpoint semantics and simulation

Theoretical Computer Science

Volumn 238, Issue 1-2, 2000, Pages 275-311

  Hesselink, Wim H ^a   Thijs, Albert ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

Fixpoint semantics; Model; Recursion; Simulation

Indexed keywords

EID: 0346008354     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00176-5     Document Type: Article

References (14)

1. P. Aczel, N. Mendier, A final coalgebra theorem, in: D.H. Pitt, D.E. Rydeheard, P. Dybjer, A.M. Pitts. A. Poigné (Eds.), Category Theory and Computer Science, Proceedings, Manchester, Lecture Notes in Computer Science, 389, Springer, Berlin, 1989, pp. 357-365.
2. R. Backhouse, J. van der Woude, Lecture Notes of the STOP 1992 Summerschool on Constructive Algorithms, 1992.
3. G. Birkhoff, On the structure of abstract algebras, Proc. Cambridge Philos. Soc. 31 (1935).
4. E.W. Dijkstra, C.S. Scholten, Predicate Calculus and Program Semantics, Springer, Berlin, 1990.
5. W.H. Hesselink, Deadlock and fairness in morphisms of transition systems, Theoret. Comput. Sci. 59 (1988) 235-257.
6. W.H. Hesselink, Programs, Recursion and Unbounded Choice, Predicate Transformation Semantics and Transformation Rules. Cambridge Tracts in Theoretical Computer Science, vol. 27, Cambridge University Press, Cambridge, 1992.
7. B. Jacobs, J. Rutten, A tutorial on (co)algebras and (co)induction, Bull. EATCS 62 (1997) 222-259.
8. E. Meier, Calculating compilers, Thesis Nijmegen, 1992.
9. R. Milner, An algebraic definition of simulation between programs, Proc. 2nd Internat. Joint Conf. on Artificial Intelligence, British Comp. Soc., 1971.
10. Y.N. Moschovakis, The logic of functional recursion, in: M.L. Dalla Chiara et al. (Eds.), Logic and Scientific Methods, Kluwer, Dordrcht, 1997, pp. 179-207.
11. D.M.R. Park, Concurrency and automata on infinite sequences, in: P. Deusen (Ed.), Proc. 5th Gl Conf., Lecture Notes in Computer Science, vol 104, Springer, Berlin, 1981, pp. 167-183.
12. J.J.M.M. Rutten, D. Turi, On the foundations of final semantics: non-standard sets, metric spaces, partial orders, in: J.W. de Bakker, W.P. de Roever, G. Rozenberg (Eds.), Proc. REX Workshop on Semantics: Foundations and Applications, Lecture Notes in Computer Science, 666, Springer, Berlin, 1993, pp. 477-530.
13. G. Takeuti, W.M. Zaring, Introduction to Axiomatic Set Theory, Springer, Berlin, 1971.
14. A.M. Thijs, Simulation and fixpoint semantics, Thesis, Groningen, 1996.