Structured transition systems as lax coalgebras

Electronic Notes in Theoretical Computer Science

Volumn 11, Issue , 1998, Pages 22-41

  Corradini, Andrea ^a   Große Rhode, Martin ^a   Heckel, Reiko ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER SCIENCE; CONCURRENT ENGINEERING; FUNCTIONS; MATHEMATICAL PROGRAMMING; SEMANTICS;

ALGEBRAIC STRUCTURES; LABELED TRANSITION SYSTEM; OPERATIONAL SEMANTICS; STRUCTURED TRANSITION SYSTEM;

ALGEBRA;

EID: 19044383948     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00051-9     Document Type: Article

References (20)

1. P. Aczel. Non-Well-Founded Sets. CSLI Lecture Notes 14, Stanford, 1988.
2. A. Corradini and A. Asperti. A categorical model for logic programs: Indexed monoidal categories. In Proceedings REX Workshop, Beekbergen, The Netherlands, June 1992, volume 666 of LNCS. Springer Verlag, 1993.
3. A. Corradini and F. Gadducci. A 2-categorical presentation of term graph rewriting. In Proceedings CTCS'97, volume 1290 of LNCS. Springer Verlag, 1997.
4. Corradini A., Montanari U. An algebraic semantics for structured transition systems and its application to logic programs. Theoret. Comput. Sci. 103:1992;51-106
5. F. Gadducci and R. Heckel. An inductive view of graph transformation. In F. Parisi-Presicce, author, Proc. of WADT'97, LNCS. Springer-Verlag, 1998. To appear.
6. Johnstone P.T. Adjoint lifting theorems for categories of algebras. Bull. London Math. Soc. 7:1975;294-297
7. Keller R. Formal verifications of parallel programs. Communications of the ACM. 7:1976;371-384
8. S. Mac Lane. Categories for the Working Mathematician, volume 5 of Graduate Texts in Mathematics. Springer, New York, 1971.
9. Meseguer J., Montanari U. Petri nets are monoids. Information and Computation. 88:1990;105-155
10. R. Milner. A Calculus of Communicating Systems, volume 92 of LNCS. Springer Verlag, 1980.
11. Montanari U, Sassone V. Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta Informaticae. XVI:1992;171-199
12. G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, Computer Science Department, 1981.
13. W. Reisig. Petri Nets: An Introduction. EACTS Monographs on Theoretical Computer Science. Springer Verlag, 1985.
14. Rutten J.J.M.M. Processes as terms: non-well-founded models for bisimulation. Mathematical Structures in Computer Science. 2:1992;257-275
15. J.J.M.M. Rutten. Universal coalgebra: a theory of systems. Technical Report CS-R9652, CWI, 1996.
16. J.J.M.M. Rutten and D. Turi. Initial algebra and final co-algebra semantics for concurrency. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, authors, Proceedings of the REX School/Symposium 'A decade of concurrency', volume 803 of LNCS. Springer Verlag, 1994.
17. D. Turi. Functorial Operational Semantics and its Denotational Dual. PhD thesis, Free University, Amsterdam, 1996.
18. th Biennial Meeting on Category Theory in Computer Science, 1993.
19. D. Turi and G. Plotkin. Towards a mathematical operational semantics. In Proc. of LICS'97, pages 280-305, 1997.
20. Winskel G. A compositional proof system on a category of labelled transition systems. Information and Computation. 87:1990;2-57