Bialgebraic Methods in Structural Operational Semantics. Invited Talk

Electronic Notes in Theoretical Computer Science

Volumn 175, Issue 1, 2007, Pages 33-43

  Klin, Bartek ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

algebra; bialgebra; category theory; coalgebra; Structural operational semantics

Indexed keywords

BIALGEBRAIC METHODS; CATEGORY THEORY; STRUCTURAL OPERATIONAL SEMANTICS;

ABSTRACTING; ALGEBRA; CONCRETES; SPECIFICATIONS;

SEMANTICS;

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

References (41)

1. Aceto L., Fokkink W.J., and Verhoef C. Structural operational semantics. In: Bergstra J.A., Ponse A., and Smolka S. (Eds). Handbook of Process Algebra (2002), Elsevier 197-292
2. Adámek, J., H. Herrlich, G. E. Strecker, "Abstract and Concrete Categories", 2004, available from http://katmat.math.uni-bremen.de/acc
3. Bartels F. GSOS for probabilistic transition systems. Proc. CMCS'02. ENTCS vol. 65 (2002) 29-54
4. F. Bartels, "On Generalised Coinduction and Probabilistic Specification Formats," PhD dissertation, CWI, Amsterdam (2004)
5. Bergstra J.A., Ponse A., and Smolka S. Handbook of Process Algebra (2002), (Elsevier
6. Bloom B., Istrail S., and Meyer A. Bisimulation can't be traced. Journal of the ACM (1995) 232-268
7. Cirstea C., and Pattinson D. Modular construction of modal logic. Proc. CONCUR'04. LNCS vol. 3170 (2004) 258-275
8. Fiore M., and Staton S. A congruence rule format for name-passing process calculi from mathematical structural operational semantics. Proc. LICS'06 (2006), IEEE Computer Society Press 49-58
9. Fiore M.P., Plotkin G.D., and Turi D. Abstract syntax with variable binding. Proc. LICS'99 (1999), IEEE Computer Society Press 193-202
10. Fiore M.P., and Turi D. Semantics of name and value passing. Proc. LICS'01 (2001), IEEE Computer Society Press 93-104
11. Fokkink W., and van Glabbeek R. Ntyft/ntyxt rules reduce to ntree rules. Information and Computation vol. 126 (1996) 1-10
12. Fokkink W.J., van Glabbeek R.J., and de Wind P. Compositionality of Hennessy-Milner logic through structural operational semantics. Proc. FCT'03. LNCS vol. 2751 (2003) 412-422
13. Gabbay M.J., and Pitts A.M. A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13 (2001) 341-363
14. Groote, J. F., M. Mousavi and M. A. Reniers, A hierarchy of SOS rule formats, in: Proc. SOS'05, 2005 (2005), pp. 3-25
15. Jacobs B. Towards a duality result in the modal logic for coalgebras. Proc. CMCS 2000. ENTCS vol. 33 (2000) 160-195
16. Jacobs B. Distributive laws for the coinductive solution of recursive equations. Information and Computation 204 (2006) 561-587
17. Jacobs B., and Rutten J.J.M.M. A tutorial on (co)algebras and (co)induction. Bulletin of the EATCS vol. 62 (1996)
18. Kick M. Bialgebraic modelling of timed processes. Proc. ICALP'02. LNCS vol. 2380 (2002) 525-536
19. Kick M. Rule formats for timed processes. Proc. CMCIM'02. ENTCS vol. 68 (2002) 12-31
20. Kick M., and Power J. Modularity of behaviours for mathematical operational semantics. Procs. CMCS'04. ENTCS vol. 106 (2004) 185-200
21. Kick M., Power J., and Simpson A. Coalgebraic semantics for timed processes. Information and Computation vol. 204 (2006) 588-609
22. Klin,B., "Abstract Coalgebraic Approach to Process Equivalence for Well-Behaved Operational Semantics," Ph.D. thesis, BRICS, Aarhus University (2004)
23. Klin B. Adding recursive constructs to bialgebraic semantics. Journal of Logic and Algebraic Programming 60-61 (2004) 259-286
24. Klin B. From bialgebraic semantics to congruence formats. Proc. SOS 2004. ENTCS vol. 128 (2005) 3-37
25. Klin B., and Sobocinski P. Syntactic formats for free: An abstract approach to process equivalence. Proc. CONCUR 2003. LNCS vol. 2761 (2003) 72-86
26. Kurz A. Coalgebras and their logics. ACM SIGACT News 37 (2006)
27. Leifer J., and Milner R. Deriving bisimulation congruences for reactive systems. Proc. CONCUR 2000. LNCS vol. 1877 (2000) 243-258
28. Lenisa M., Power J., and Watanabe H. Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads. Proc. CMCS'00. ENTCS vol. 33 (2000), Elsevier 230-260
29. Lenisa M., Power J., and Watanabe H. Category theory for operational semantics. Theoretical Computer Science vol. 327 (2004) 135-154
30. Mac Lane S. Categories for the Working Mathematician. second edition (1998), Springer
31. Milner R., and Tofte M. The Definition of Standard ML. revised edition (1997), MIT Press
32. Mosses P.D. Modular structural operational semantics. Journal of Logic and Algebraic Programming 60-61 (2004) 195-228
33. Mousavi M.R., and Reniers M.A. Congruence for structural congruences. Proc. FOSSACS'05. LNCS vol. 3441 (2005) 47-62
34. Pavlovic D., Mislove M., and Worrell J.B. Testing semantics: connecting processes and process logics. Proc. AMAST'05. LNCS vol. 4019 (2005) 308-322
35. Plotkin G.D. The origins of structural operational semantics. Journal of ogic and Algebraic Programming 60-61 (2004) 3-15
36. Plotkin G.D. A structural approach to operational semantics. Journal of Logic and Algebraic Programming 60-61 (2004) 17-139
37. Power J., and Watanabe H. Distributivity for a monad and a comonad. Procs. CMCS'99. ENTCS vol. 19 (1999) 102
38. Rutten J.J.M.M. Universal coalgebra: a theory of systems. Theoretical Computer Science vol. 249 (2000) 3-80
39. Sassone V., and Sobocinski P. Locating reaction with 2-categories. Theoretical Computer Science vol. 333 (2003) 297-327
40. Turi D., and Plotkin G.D. Towards a mathematical operational semantics. Proc. LICS'97 (1997), IEEE Computer Society Press 280-291
41. Watanabe H. Well-behaved translations between structural operational semantics. ENTCS vol. 65 (2002)