Generic Trace Theory

Electronic Notes in Theoretical Computer Science

Volumn 164, Issue 1, 2006, Pages 47-65

  Hasuo, Ichiro ^a   Jacobs, Bart ^a   Sokolova, Ana ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

coalgebra; Kleisli category; linear time semantics; monad; non determinism; probability; trace semantics

Indexed keywords

COALGEBRA; KLEISLI CATEGORY; LINEAR TIME SEMANTICS; MONAD; NON-DETERMINISM; TRACE SEMANTICS;

FUNCTION EVALUATION; LINEAR ALGEBRA; PROBABILISTIC LOGICS; PROBABILITY; SET THEORY; THEOREM PROVING;

SEMANTICS;

EID: 33749562380     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.06.004     Document Type: Article

References (27)

1. Abramsky S., and Jung A. Domain theory. In: Abramsky S., Gabbai D.M., and Maibaum T.S.E. (Eds). Handbook of Logic in Computer Science, volume 3 (1994), Oxford Univ. Press 1-168
2. Adámek J., and Koubek V. Least fixed point of a functor. Journ. Comp. Syst. Sci. 19 2 (1979) 163-178
3. Baeten J.C.M., and de Vink E.P. Axiomatizing GSOS with termination. In: Alt H., and Ferreira A. (Eds). International Symposium on Theoretical Aspects of Computer Science. (STACS) 2002. Lect. Notes Comp. Sci. number 2285 (2002), Springer-Verlag, Berlin 583-595
4. In: Bergstra J.A., Ponse A., and Smolka S.A. (Eds). Handbook of Process Algebra (2001), North-Holland, Amsterdam
5. Borceux F. Handbook of Categorical Algebra. Encyclopedia of Mathematics volume 50 (1994), Cambridge Univ. Press 51 and 52
6. Brzozowski J.A. Derivatives of regular expressions. Journ. ACM 11 4 (1964) 481-494
7. M.M. Fokkinga. Monadic maps and folds for arbitrary datatypes. Memoranda Informatica, University of Twente, 94-28, 1994
8. I. Hasuo and B. Jacobs. Coalgebraic trace semantics for probabilistic systems. In P. Mosses, J. Power, and M. Seisenberger, editors, CALCO-jnr Workshop, 2005
9. Hasuo I., and Jacobs B. Context-free languages via coalgebraic trace semantics. In: Fiadeiro J.L., Harman N., Roggenbach M., and Rutten J. (Eds). Algebra and Coalgebra in Computer Science. (CALCO'05). Lect. Notes Comp. Sci. number 3629 (2005), Springer, Berlin 213-231
10. Jacobs B. Semantics of weakening and contraction. Ann. Pure & Appl. Logic 69 1 (1994) 73-106
11. Jacobs B. Trace semantics for coalgebras. Coalgebraic Methods in Computer Science. Elect. Notes in Theor. Comp. Sci. 106 (2004) Elsevier, Amsterdam
12. Jacobs B. Introduction to coalgebra. Towards mathematics of states and observations. Draft of a book (2005). www.cs.ru.nl/B.Jacobs/PAPERS/index.html
13. Jay C.B. A semantics for shape. Science of Comput. Progr. 25 (1995) 251-283
14. Kelly G.M. Basic Concepts of Enriched Category Theory. LMS number 64 (1982), Cambridge Univ. Press
15. Kock A. Monads on symmetric monoidal closed categories. Arch. Math. XXI (1970) 1-10
16. Kupke C., and Venema Y. Closure properties of coalgebra automata. Logic in Computer Science (2005)
17. Pardo A. Fusion of recursive programs with computational effects. Theor. Comp. Sci. 260 1-2 (2001) 165-207
18. Power J., and Turi D. A coalgebraic foundation for linear time semantics. In: Hofmann M., Pavlović D., and Rosolini G. (Eds). Category Theory and Computer Science 1999. Elect. Notes in Theor. Comp. Sci. 29 (1999) Elsevier, Amsterdam
19. Rutten J. Universal coalgebra: a theory of systems. Theor. Comp. Sci. 249 (2000) 3-80
20. Rutten J., and Turi D. Initial algebra and final coalgebra semantics for concurrency. In: de Bakker J.W., de Roever W.P., and Rozenberg G. (Eds). A Decade of Concurrency. Lect. Notes Comp. Sci. number 803 (1994), Springer, Berlin 530-582
21. R. Segala. Modeling and verification of randomized distributed real-time systems. PhD thesis, MIT, 1995
22. Smyth M.B., and Plotkin G.D. The category theoretic solution of recursive domain equations. SIAM Journ. Comput. 11 (1982) 761-783
23. A. Sokolova. Coalgebraic Analysis of Probabilistic Systems. PhD thesis, TU Eindhoven, 2005
24. van Glabbeek R.J. The linear time-branching time spectrum (extended abstract). In: Baeten J.C.M., and Klop J.W. (Eds). Proceedings CONCUR '90, Theories of Concurrency: Unification and Extension. Amsterdam, August 1990. Lect. Notes Comp. Sci. volume 458 (1990), Springer 278-297
25. van Glabbeek R.J., Smolka S.A., and Steffen B. Reactive, generative, and stratified models of probabilistic processes. Information and Computation 121 (1995) 59-80
26. D. Varacca and G. Winskel. Distributing probabililty over nondeterminism. Math. Struct. in Comp. Sci., 2005. To appear
27. M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In FOCS '85, pages 327-338, 1985