The microcosm principle and concurrency in coalgebra

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4962 LNCS, Issue , 2008, Pages 246-260

  Hasuo, Ichiro ^a,c,d   Jacobs, Bart ^a,e   Sokolova, Ana ^b  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^b UNIVERSITY OF SALZBURG   (Austria)

^c KYOTO UNIVERSITY   (Japan)

^d JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

^e EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC THEORY; CO-ALGEBRAS; COMPLEX SYSTEMS; COMPOSITIONALITY; COMPUTATIONAL STRUCTURES; DIFFERENT DOMAINS; EUROPEAN; FINAL COALGEBRA; HEIDELBERG (CO); INTERNATIONAL (CO); MODULAR VERIFICATION; MONOIDAL CATEGORIES; NATURAL TRANSFORMATIONS; PARALLEL COMPOSITION; SOFTWARE SCIENCE; STATE-BASED SYSTEMS;

FOUNDATIONS;

EID: 47249085675     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78499-9_18     Document Type: Conference Paper

References (27)

1. Baez, J.C., Dolan, J.: Higher dimensional algebra III: n-categories and the algebra of opetopes. Adv. Math. 135, 145-206 (1998)
2. Barr, M., Wells, C.: Toposes, Triples and Theories. Springer, Berlin (1985)
3. Bartels, F.: On generalised coinduction and probabilistic specification formats. Distributive laws in coalgebraic modelling. PhD thesis, Free Univ. Amsterdam (2004)
4. Borceux, F.: Handbook of Categorical Algebra. Encyclopedia of Mathematics, vol. 50, 51, 52. Cambridge Univ. Press, Cambridge (1994)
5. Hasuo, I.: Generic forward and backward simulations. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 406-420. Springer, Heidelberg (2006)
6. Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Logical Methods in Comp. Sci. 3(4-11) (2007)
7. Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall, Englewood Cliffs (1985)
8. Hyland, M., Power, A.J.: Discrete Lawvere theories and computational effects. Theor. Comp. Sci. 366(1-2), 144-162 (2006)
9. Jacobs, B.: Categorical Logic and Type Theory. North Holland, Amsterdam (1999)
10. Jacobs, B.: Trace semantics for coalgebras. In: Adámek, J., Milius, S. (eds.) Coalgebraic Methods in Computer Science. Elect. Notes in Theor. Comp. Sci., vol. 106, Elsevier, Amsterdam (2004)
11. Jacobs, B.: Introduction to coalgebra. Towards mathematics of states and observations (2005) Draft of a book, www.cs.ru.nl/B.Jacobs/PAPERS/index.html
12. Jacobs, B.: A bialgebraic review of deterministic automata, regular expressions and languages. In: Futatsugi, K., Jouannaud, J.-P., Meseguer, J. (eds.) Algebra, Meaning, and Computation. LNCS, vol. 4060, pp. 375-404. Springer, Heidelberg (2006)
13. Johnstone, P.T., Power, A.J., Tsujishita, T., Watanabe, H., Worrell, J.: An axiomatics for categories of transition systems as coalgebras. In: Logic in Computer Science, IEEE, Computer Science Press, Los Alamitos (1998)
14. Kick, M., Power, A.J., Simpson, A.: Coalgebraic semantics for timed processes. Inf. & Comp. 204(4), 588-609 (2006)
15. Klin, B.: From bialgebraic semantics to congruence formats. In: Workshop on Structural Operational Semantics (SOS 2004). Elect. Notes in Theor. Comp. Sci. 128, 3-37 (2005)
16. Klin, B.: Bialgebraic operational semantics and modal logic. In: Logic in Computer Science, pp. 336-345. IEEE Computer Society, Los Alamitos (2007)
17. Kock, A., Reyes, G.E.: Doctrines in categorical logic. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 283-313. North-Holland, Amsterdam (1977)
18. Lawvere, F.W.: Functorial Semantics of Algebraic Theories and Some Algebraic Problems in the Context of Functorial Semantics of Algebraic Theories. PhD thesis, Columbia University, 1963. Reprints in Theory and Applications of Categories 5, 1-121 (2004)
19. Lee, E.A.: Making concurrency mainstream, Invited talk at CONCUR 2006 (2006)
20. Mac Lane, S.: Categories for the Working Mathematician, 2nd edn. Springer, Berlin (1998)
21. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
22. Moggi, E.: Notions of computation and monads. Inf. & Comp. 93(1), 55-92 (1991)
23. Mousavi, M.R., Reniers, M.A., Groote, J.F.: A syntactic commutativity format for SOS. Inform. Process. Lett. 93(5), 217-223 (2005)
24. Nishizawa, K., Power, A.J.: Lawvere theories enriched over a general base. Journ. of Pure & Appl. Algebra (to appear, 2006)
25. Power, J., Turi, D.: A coalgebraic foundation for linear time semantics. In: Category Theory and Computer Science. Elect. Notes in Theor. Comp. Sci., vol. 29, Elsevier, Amsterdam (1999)
26. Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theor. Comp. Sci. 249, 3-80 (2000)
27. Turi, D., Plotkin, G.: Towards a mathematical operational semantics. In: Logic in Computer Science, pp. 280-291. IEEE, Computer Science Press, Los Alamitos (1997)