Feedback, trace and fixed-point semantics

RAIRO - Theoretical Informatics and Applications

Volumn 36, Issue 2, 2002, Pages 181-194

  Katis, P ^a   Sabadini, Nicoletta ^a   Walters, Robert F C ^a,b  

^a UNIVERSITY OF INSUBRIA   (Italy)

^b UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL GEOMETRY; COMPUTER SCIENCE; FEEDBACK; SET THEORY; TENSORS;

FIXED-POINT SEMANTICS; NETWORK ALGEBRAS;

SEMANTICS;

EID: 14244272156     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita:2002009     Document Type: Article

References (35)

1. S. Abramsky, Retracing some paths in process algebras, Concur '96, edited by U. Montanari and V. Sassone. Springer-Verlag, Lecture Notes in Comput. Sci. 1119 (1996) 1-17
2. M. Bartha, An algebraic model of synchronous systems. Inform. and Comput. 97 (1992) 97-131.
3. L. Bernatsky and Z. Ésik, Sematics of flowchart programs and the free Conway theories. RAIRO: Theoret. Informatics Applic. 32 (1998) 35-78.
4. S.L. Bloom and Z. Ésik, Axiomatising schemes and their behaviours. J. Comput. System Sci. 31 (1985) 375-393.
5. S.L. Bloom and Z. Ésik, Iteration Theories: The Equational Logic of Iterative Processes. Springer-Verlag, EATCS Monogr. Theoret. Comput. Sci. (1993).
6. S.L. Bloom and Z. Ésik, Matrix and matricial iteration theories, Part I. J. Comput. System Sci. 46 (1993) 381-408.
7. S.L. Bloom, N. Sabadini and R.F.C. Walters, Matrices, machines and behaviors. Appl. Categorical Structures 4 (1996) 343-360.
8. R.F. Blute, J.R.B. Cockett and R.A.G. Seely, Feedback for linearly distributive categories: Traces and fixpoints. J. Pure Appl. Algebra 154 (2000) 27-69.
9. A. Carboni and R.F.C. Walters, Cartesian Bicategories I. J. Pure Appl. Algebra 49 (1987) 11-32.
10. J. Conway, Regular Algebra and Finite Machines. Chapman and Hall, London (1971).
11. C.C. Elgot, Monadic computation and iterative algebraic theories, edited by J.C. Shepherdson. North Holland, Amsterdam, Logic Colloquium 1973, Studies in Logic 80 (1975).
12. C.C. Elgot, Matricial Theories. J. Algebra 42 (1976) 391-421.
13. F. Gadducci, U. Montanari, P. Katis, N. Sabadini and R.F.C. Walters, Comparing Cospanspans and Tiles via a Hoare-style process calculus. TOSCA Udine, Electron. Notes Theoret. Comput. Sci. 62 (2001) 152-171.
14. M. Hasegawa, Models of Sharing Graphs: A categorical semantics of let and letrec, Ph.D. Thesis. Edinburgh (1997), Springer (1999).
15. A. Joyal, R. Street and D. Verity, Traced monoidal categories. Math. Proc. Camb. Phil. Soc. 119 (1996) 447-468.
16. A. Joyal and R. Street, Braided tensor categories. Adv. in Math. 102 (1993) 20-78.
17. W. Khalil and R.F.C. Walters, An imperative language based on distributive categories II. RAIRO: Theoret. Informatics Appl. 27 (1993) 503-522.
18. P. Katis, N. Sabadini and R.F.C. Walters, Bicategories of processes. J. Pure Appl. Algebra 115 (1997) 141-178.
19. P. Katis, N. Sabadini and R.F.C. Walters, Span(Graph): A categorical algebra of transition systems, in Proc. Algebraic Methodology and Software Technology. Springer-Verlag, Lecture Notes in Comput. Sci. 1349 (1997), 307-321.
20. P. Katis, N. Sabadini and R.F.C. Walters, On the algebra of systems with feedback and boundary. Rend. Circ. Mat. Palermo (2) Suppl. 63 (2000) 123-156.
21. P. Katis, N. Sabadini and R.F.C. Walters, A formalization of the IWIM Model, in Proc. COORDINATION 2000, edited by A. Porto and G.-C. Roman. Springer-Verlag, Lecture Notes in Comput. Sci. 1906 (2000) 267-283.
22. P. Katis, N. Sabadini and R.F.C. Walters, Recursion and concurrency, Invited talk, FICS 2001, Florence (2001).
23. P. Katis and R.F.C. Walters, The compact closed bicategory of left adjoints. Math. Proc. Camb. Phil. Soc. 130 (2001) 77-87.
24. G.M. Kelly and M. Laplaza, Coherence for compact closed categories. J. Pure Appl. Algebra 19 (1980) 193-213.
25. K. Krohn and J. Rhodes, Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machines. Trans. Amer. Math. Soc. 116 (1965) 450-464.
26. M. Nagata, Local rings. Interscience (1962).
27. R. Penrose, Applications of negative dimensional torsors, edited by D.J.A. Welsh. Academic Press, New York, Comb. Math. Appl. (1971) 221-244.
28. W.J. Rugh, Linear System Theory, Second Edition. Prentice Hall (1996).
29. J.J.M.M. Rutten, A calculus of transition systems (towards universal coalgebra), in Modal Logic and Process Algebra, a bisimulation perspective, edited by A. Ponse, M. de Rijke and Y. Venema. CSLI Publications, Standford, CSLI Lecture Notes 53 (1995) 231-256.
30. N. Sabadini, S. Vigna and R.F.C. Walters, A note on recursive functions. Math. Struct. Comput. Sci. 6 (1996) 127-139.
31. M.W. Shields, An introduction to Automata Theory. Blackwell Scientic Publications, Oxford (1987).
32. A. Simpson and G. Plotkin, Complete axioms for categorical fixed-point operators. in Proc. 15th LICS (2000) 30-41.
33. Gh. Stefanescu, On flowchart theories I: The deterministic case. J. Comput. System Sci. 35 (1985) 163-191.
34. G. Stefanescu, Network Algebra. Springer-Verlag (2000).
35. R.F.C. Walters, Categories and Computer Science. Carslaw Publications (1991), Cambridge University Press (1992).