<bibliography>
 <citation type="incollection" key="AFV">
  <author>L. <surname>Aceto</surname></author>
  <author>W. <surname>Fokkink</surname></author>
  <author>C. <surname>Verhoef</surname></author>
  <year>2001</year>
  <title>Structural Operational Semantics</title>
  <booktitle>Handbook of Process Algebra</booktitle>
  <publisher>Elsevier Science</publisher>
  <pages>197&#8211;292</pages>
  <doi>10.1016/B978-044482830-9/50021-7</doi>
 </citation>
 <citation type="article" key="AdamekP04">
  <author>J. <surname>Ad&#225;mek</surname></author>
  <author>H-E. <surname>Porst</surname></author>
  <year>2004</year>
  <title>On tree coalgebras and coalgebra presentations</title>
  <journal>Theor. Comput. Sci.</journal>
  <volume>311</volume>
  <number>1-3</number>
  <pages>257&#8211;283</pages>
  <doi>10.1016/S0304-3975(03)00378-5</doi>
 </citation>
 <citation type="book" key="AR94">
  <author>J. <surname>Ad&#225;mek</surname></author>
  <author>J. <surname>Rosick&#253;</surname></author>
  <year>1994</year>
  <title>Locally Presentable and Accessible Categories</title>
  <series>Cambridge Tracts in Mathematics</series>
  <publisher>Cambridge University Press</publisher>
  <doi>10.1017/CBO9780511600579</doi>
 </citation>
 <citation type="phdthesis" key="Bartels04">
  <author>F. <surname>Bartels</surname></author>
  <year>2004</year>
  <title>On generalised coinduction and probabilistic specification formats</title>
  <school>CWI, Amsterdam</school>
 </citation>
 <citation type="article" key="BloomIM95">
  <author>B. <surname>Bloom</surname></author>
  <author>S. <surname>Istrail</surname></author>
  <author>A. <surname>Meyer</surname></author>
  <year>1995</year>
  <title>Bisimulation Can't be Traced</title>
  <journal>J. ACM</journal>
  <volume>42</volume>
  <number>1</number>
  <pages>232&#8211;268</pages>
  <doi>10.1145/200836.200876</doi>
 </citation>
 <citation type="article" key="BonchiPPR17">
  <author>F. <surname>Bonchi</surname></author>
  <author>D. <surname>Petrisan</surname></author>
  <author>D. <surname>Pous</surname></author>
  <author>J. <surname>Rot</surname></author>
  <year>2017</year>
  <title>A general account of coinduction up-to</title>
  <journal>Acta Inf.</journal>
  <volume>54</volume>
  <number>2</number>
  <pages>127&#8211;190</pages>
  <doi>10.1007/s00236-016-0271-4</doi>
 </citation>
 <citation type="incollection" key="droste2009semirings">
  <author>M. <surname>Droste</surname></author>
  <author>W. <surname>Kuich</surname></author>
  <year>2009</year>
  <title>Semirings and formal power series</title>
  <booktitle>Handbook of Weighted Automata</booktitle>
  <publisher>Springer</publisher>
  <pages>3&#8211;28</pages>
  <doi>10/bj2xgm</doi>
 </citation>
 <citation type="inproceedings" key="MS10">
  <author>M. <surname>Fiore</surname></author>
  <author>S. <surname>Staton</surname></author>
  <year>2010</year>
  <title>Positive structural operational semantics and monotone distributive laws</title>
  <booktitle>CMCS Short Contributions</booktitle>
  <pages>8</pages>
 </citation>
 <citation type="article" key="GummS01">
  <author>H. P. <surname>Gumm</surname></author>
  <author>T. <surname>Schr&#246;der</surname></author>
  <year>2001</year>
  <title>Monoid-labeled transition systems</title>
  <journal>Electr. Notes Theor. Comput. Sci.</journal>
  <volume>44</volume>
  <number>1</number>
  <pages>185&#8211;204</pages>
  <doi>10.1016/S1571-0661(04)80908-3</doi>
 </citation>
 <citation type="article" key="HJ04">
  <author>J. <surname>Hughes</surname></author>
  <author>B. <surname>Jacobs</surname></author>
  <year>2004</year>
  <title>Simulations in coalgebra</title>
  <journal>Theor. Comput. Sci.</journal>
  <volume>327</volume>
  <number>1-2</number>
  <pages>71&#8211;108</pages>
  <doi>10.1016/j.tcs.2004.07.022</doi>
 </citation>
 <citation type="book" key="Jacobs:coalg">
  <author>B. <surname>Jacobs</surname></author>
  <year>2016</year>
  <title>Introduction to Coalgebra: Towards Mathematics of States and Observation</title>
  <series>Cambridge Tracts in Theoretical Computer Science</series>
  <volume>59</volume>
  <publisher>Cambridge University Press</publisher>
  <doi>10.1017/CBO9781316823187</doi>
 </citation>
 <citation type="incollection" key="BR12">
  <author>B. <surname>Jacobs</surname></author>
  <author>J. <surname>Rutten</surname></author>
  <year>2011</year>
  <title>An introduction to (co)algebras and (co)induction.</title>
  <booktitle>Advanced Topics in Bisimulation and Coinduction</booktitle>
  <publisher>Cambridge University Press</publisher>
  <pages>38&#8211;99</pages>
  <doi>10.1017/CBO9780511792588.003</doi>
 </citation>
 <citation type="article" key="J75">
  <author>P. T. <surname>Johnstone</surname></author>
  <year>1975</year>
  <title>Adjoint lifting theorems for categories of algebras</title>
  <journal>Bulletin of the London Mathematical Society</journal>
  <volume>7</volume>
  <number>3</number>
  <pages>294&#8211;297</pages>
  <doi>10.1112/blms/7.3.294</doi>
 </citation>
 <citation type="inproceedings" key="Klin09">
  <author>B. <surname>Klin</surname></author>
  <year>2009</year>
  <title>Structural Operational Semantics for Weighted Transition Systems</title>
  <editor>J. <surname>Palsberg</surname></editor>
  <booktitle>Semantics and Algebraic Specification</booktitle>
  <series>LNCS</series>
  <volume>5700</volume>
  <publisher>Springer</publisher>
  <pages>121&#8211;139</pages>
  <doi>10/cxqzcf</doi>
 </citation>
 <citation type="article" key="Klin11">
  <author>B. <surname>Klin</surname></author>
  <year>2011</year>
  <title>Bialgebras for structural operational semantics: An introduction</title>
  <journal>TCS</journal>
  <volume>412</volume>
  <number>38</number>
  <pages>5043&#8211;5069</pages>
  <doi>10.1016/j.tcs.2011.03.023</doi>
 </citation>
 <citation type="inproceedings" key="KlinN14">
  <author>B. <surname>Klin</surname></author>
  <author>B. <surname>Nachy&#322;a</surname></author>
  <year>2014</year>
  <title>Distributive Laws and Decidable Properties of SOS Specifications</title>
  <editor>Johannes <surname>Borgstr&#246;m</surname></editor>
  <editor>Silvia <surname>Crafa</surname></editor>
  <booktitle>Proc. EXPRESS/SOS 2014</booktitle>
  <series>EPTCS</series>
  <volume>160</volume>
  <pages>79&#8211;93</pages>
  <doi>10.4204/EPTCS.160.8</doi>
 </citation>
 <citation type="article" key="KlinN17">
  <author>B. <surname>Klin</surname></author>
  <author>B. <surname>Nachy&#322;a</surname></author>
  <year>2017</year>
  <title>Some undecidable properties of SOS specifications</title>
  <journal>J. Log. Algebr. Meth. Program.</journal>
  <volume>87</volume>
  <pages>94&#8211;109</pages>
  <doi>10.1016/j.jlamp.2016.08.005</doi>
 </citation>
 <citation type="article" key="PowerW02">
  <author>J. <surname>Power</surname></author>
  <author>H. <surname>Watanabe</surname></author>
  <year>2002</year>
  <title>Combining a monad and a comonad</title>
  <journal>Theor. Comput. Sci.</journal>
  <volume>280</volume>
  <number>1-2</number>
  <pages>137&#8211;162</pages>
  <doi>10.1016/S0304-3975(01)00024-X</doi>
 </citation>
 <citation type="article" key="RotB16">
  <author>J. <surname>Rot</surname></author>
  <author>M. M. <surname>Bonsangue</surname></author>
  <year>2016</year>
  <title>Structural congruence for bialgebraic semantics</title>
  <journal>J. Log. Algebr. Meth. Program.</journal>
  <volume>85</volume>
  <number>6</number>
  <pages>1268&#8211;1291</pages>
  <doi>10.1016/j.jlamp.2016.08.001</doi>
 </citation>
 <citation type="article" key="Rutten00">
  <author>J. J. M. M. <surname>Rutten</surname></author>
  <year>2000</year>
  <title>Universal coalgebra: a theory of systems</title>
  <journal>TCS</journal>
  <volume>249</volume>
  <number>1</number>
  <pages>3&#8211;80</pages>
  <url>http://dx.doi.org/10.1016/S0304-3975(00)00056-6</url>
 </citation>
 <citation type="inproceedings" key="Staton08">
  <author>S. <surname>Staton</surname></author>
  <year>2008</year>
  <title>General Structural Operational Semantics through Categorical Logic</title>
  <booktitle>LICS</booktitle>
  <publisher>IEEE Computer Society</publisher>
  <pages>166&#8211;177</pages>
  <doi>10.1109/LICS.2008.43</doi>
 </citation>
 <citation type="inproceedings" key="TP97">
  <author>D. <surname>Turi</surname></author>
  <author>G. <surname>Plotkin</surname></author>
  <year>1997</year>
  <title>Towards a Mathematical Operational Semantics</title>
  <booktitle>LICS</booktitle>
  <publisher>IEEE Computer Society</publisher>
  <pages>280&#8211;291</pages>
  <doi>10.1109/LICS.1997.614955</doi>
 </citation>
</bibliography>
