Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems

Electronic Notes in Theoretical Computer Science

Volumn 203, Issue 5, 2008, Pages 131-152

  Jacobs, Bart ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

coalgebra; probabilistic nondeterminism

Indexed keywords

CHEMICAL MODIFICATION; PROBABILITY; SEMANTICS;

(SEMI)AUTOMATA; COALGEBRAIC; COALGEBRAIC TRACE SEMANTICS; PROBABILISTIC SYSTEMS; STATE-BASED SYSTEMS; TRACE SEMANTICS;

INFORMATION THEORY;

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

References (21)

1. Abramsky S., and Vickers S.J. Quantales, observational logic and process semantics. Math. Struct. in Comp. Sci. 3 (1993) 161-227
2. Barr M., and Wells Ch. Toposes, Triples and Theories (1985), Springer, Berlin. Revised and corrected version available from URL: www.cwru.edu/artsci/math/wells/pub/ttt.html
3. Bartels F., Sokolova A., and de Vink E. A hierarchy of probabilistic system types. Theor. Comp. Sci. 327 1-2 (2004) 3-22
4. Borceux F. Handbook of Categorical Algebra. Encyclopedia of Mathematics volume 50, 51 and 52 (1994), Cambridge Univ. Press
5. L. Cheung. Reconciling Nondeterministic and Probabilistic Choices. PhD thesis, Univ. Nijmegen, 2006
6. Cïrstea C., and Pattinson D. Modular proof systems for coalgebraic logics. Theor. Comp. Sci. 388 (2007) 83-108
7. Golan J.S. Semirings and their Applications (1999), Kluwer Academic Publishers
8. Hasuo I. Generic forward and backward simulations. In: Baier C., and Hermanns H. (Eds). International Conference on Concurrency Theory. (CONCUR 2006). Lect. Notes Comp. Sci. number 4137 (2006), Springer, Berlin 406-420
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. Hasuo I., Jacobs B., and Sokolova A. Generic trace theory. Logical Methods in Comp. Sci. 3 4:11 (2007)
11. Hasuo I., Jacobs B., and Sokolova A. The microcosm principle and concurrency in coalgebra. Foundations of Software Science and Computation Structures. LNCS (2008), Springer, Berlin
12. Jacobs B. Semantics of weakening and contraction. Ann. Pure & Appl. Logic 69 1 (1994) 73-106
13. Joyal A., and Tierney M. An extension of the Galois theory of Grothendieck. Memoirs of the AMS 51 309-4 (1984)
14. Mac Lane S. Categories for the Working Mathematician (1971), Springer, Berlin
15. Lang S. Algebra. 2nd rev. edition (1984), Addison-Wesley
16. Rosenthal K.I. Quantales and their applications. Pitman Research Notes in Math. Number 234 (1990), Longman Scientific & Technical
17. Segala R. A compositional trace-based semantics for probabilistic automata. In: Lee I., and Molka S.A. (Eds). Concur'95: Concurrency Theory. Lect. Notes Comp. Sci. number 962 (1995), Springer, Berlin 234-248
18. Smyth M.B., and Plotkin G.D. The category theoretic solution of recursive domain equations. SIAM Journ. Comput. 11 (1982) 761-783
19. Tix R., Keimel K., and Plotkin G. Semantic Domains for Combining Probability and Non-Determinism. Elect. Notes in Theor. Comp. Sci. 129 (2005) Elsevier, Amsterdam
20. D. Varacca. Probability, Nondeterminism and Concurrency: Two Denotational Models for Probabilistic Computation. PhD thesis, Univ. Aarhus, 2003. BRICS Dissertation Series, DS-03-14
21. Varacca D., and Winskel G. Distributing probability over non-determinism. Math. Struct. in Comp. Sci. 16 (2006) 87-113