Terminal metric spaces of finitely branching and image finite linear processes

Theoretical Computer Science

Volumn 202, Issue 1-2, 1998, Pages 223-230

  Van Breugel, Franck ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Coalgebra; Finitely branching; Image finite; Metric space; Transition system

Indexed keywords

EID: 0346786575     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00251-X     Document Type: Article

References (26)

1. P. Aczel, Non-well-founded sets, CSLI Lecture Notes, vol. 14, Centre for the Study of Languages and Information, Stanford, 1988.
2. P. America, J.J.M.M. Rutten, Solving reflexive domain equations in a category of complete metric spaces, J. Comput. Syst. Sci. 39 (3) (1989) 343-375.
3. R. Baire, Sur la représentation des fonctions discontinues, Acta Mathematica 32 (1) (1909) 97-176.
4. M. Barr, Terminal coalgebras in well-founded set theory, Theoret. Comput. Sci. 114 (2) (1993) 299-315.
5. J.W. de Bakker, E.P. de Vink, Control Flow Semantics. Foundations of Computing Series, MIT Press, Cambridge, 1996.
6. J.W. de Bakker, J.H.A. Warmerdam, Metric pomset semantics for a concurrent language with recursion, in: I. Guessarian (Ed.), Proc. LITP Spring School on Theoretical Computer Science, La Roche Posay, Lecture Notes in Computer Science, vol. 469, Springer, Berlin, April 1990, pp. 21-49.
7. J.W. de Bakker, J.H.A. Warmerdam, Four domains for concurrency, Theoret. Comput. Sci. 90 (1): (1991) 127-149.
8. J.W. de Bakker, J.I. Zucker, Processes and the denotational semantics of concurrency, Inform. and Control 54 (1/2) (1982) 70-120.
9. J.W. de Bakker, J.I. Zucker, Compactness in semantics for merge and fair merge, in: E. Clarke, D. Kozen (Eds.), Proc. 4th Workshop on Logics of Programs, Pittsburgh, Lecture Notes in Computer Science, vol. 164, Springer, Berlin, June 1983, pp. 18-33.
10. R.J. van Glabbeek, The linear time - branching time spectrum, in: J.C.M. Baeten, J.W. Klop (Eds.), Proc. CONCUR'90, Amsterdam, Lecture Notes in Computer Science, vol. 458, Springer, Berlin, August 1990, pp. 278-297.
11. H. Hahn, Reelle Funktionen I, Akademische Verlagsgesellschaft, Leipzig, 1932.
12. P. Hancock, Partial Constructions, Draft, University of Edinburgh, March 1997.
13. F. Hausdorff, Grundzüge der Mengenlehre, Leipzig, 1914.
14. M. Hennessy, G.D. Plotkin, Full abstraction for a simple parallel programming language, in: J. Bečvář (Ed.), Proc. 8th Symp. on Math. Found. Comput. Sci., Olomouc, Lecture Notes in Computer Science, vol. 74, Springer, Berlin, September 1979, pp. 108-120.
15. B. Jacobs, J. Rutten, A tutorial on (co)algebras and (co)induction, Bull. EATCS, 62 (1997) 222-259.
16. R.M. Keller, Formal verification of parallel programs, Commun. ACM 19 (7) (1976) 371-384.
17. S.C. Kleene, Representation of events in nerve nets and finite automata, in: C.E. Shannon, J. McCarthy (Eds.), Automata Studies, Ann. Math. Stud., vol. 34, Princeton University Press, Princeton, 1956, pp. 3-41.
18. D. König, Sur les correspondances multivoques des ensembles, Fundamenta Mathematicae 8 (1926) 114-134.
19. K. Kuratowski, Sur une méthode de métrisation complète des certains espaces d'ensembles compacts, Fundamenta Mathematicae 43 (1) (1956) 114-138.
20. L.H. Landweber, Decision problems for ω-automata, Math. Systems Theory 3 (4) (1969) 376-384.
21. M. Nivat, Infinite words, infinite trees, infinite computations, in: J.W. de Bakker, J. van Leeuwen (Eds.), Found. Comput. Sci. III, part 2: Languages, Logic, Semantics, Mathematical Centre Tracts, vol. 109, Mathematical Centre, Amsterdam, 1979, pp. 3-52.
22. G.D. Plotkin, A structural approach to operational semantics. Report DAIMI FN-19, Aarhus University, Aarhus, 1981.
23. A. Pnueli, Linear and branching structures in the semantics and logics of reactive systems, in: W. Brauer (Ed.), Proc. 12th Int. Colloq. on Automata, Languages and Programming, Nafplion, Lecture Notes in Computer Science, vol. 194. Springer, Berlin, July 1985, pp. 15-32.
24. 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, Beekbergen, Lecture Notes in Computer Science, vol. 666, Springer, Berlin, June 1992, pp. 477-530.
25. J.J.M.M. Rutten, D. Turi, Initial algebra and final coalgebra semantics for concurrency, in: J.W. de Bakker, W.-P. de Roever, G. Rozenberg (Eds.), Proc. REX School/Symp. A Decade of Concurrency: Reflections and Perspectives, Noordwijkerhout, Lecture Notes in Computer Science, vol. 803, Springer, Berlin, June 1993, pp. 530-582.
26. D. Turi, B. Jacobs, On final semantics for applicative and non-deterministic languages, presented at the 5th Conf. on Category Theory and Computer Science, Amsterdam, 1993.