References

  1. L. Aceto, W. Fokkink & C. Verhoef (2001): Structural Operational Semantics. In: Handbook of Process Algebra. Elsevier Science, pp. 197–292, doi:10.1016/B978-044482830-9/50021-7.
  2. J. Adámek & H-E. Porst (2004): On tree coalgebras and coalgebra presentations. Theor. Comput. Sci. 311(1-3), pp. 257–283, doi:10.1016/S0304-3975(03)00378-5.
  3. J. Adámek & J. Rosický (1994): Locally Presentable and Accessible Categories. Cambridge Tracts in Mathematics. Cambridge University Press, doi:10.1017/CBO9780511600579.
  4. F. Bartels (2004): On generalised coinduction and probabilistic specification formats. CWI, Amsterdam.
  5. B. Bloom, S. Istrail & A. Meyer (1995): Bisimulation Can't be Traced. J. ACM 42(1), pp. 232–268, doi:10.1145/200836.200876.
  6. F. Bonchi, D. Petrisan, D. Pous & J. Rot (2017): A general account of coinduction up-to. Acta Inf. 54(2), pp. 127–190, doi:10.1007/s00236-016-0271-4.
  7. M. Droste & W. Kuich (2009): Semirings and formal power series. In: Handbook of Weighted Automata. Springer, pp. 3–28, doi:10/bj2xgm.
  8. M. Fiore & S. Staton (2010): Positive structural operational semantics and monotone distributive laws. In: CMCS Short Contributions, pp. 8.
  9. H. P. Gumm & T. Schröder (2001): Monoid-labeled transition systems. Electr. Notes Theor. Comput. Sci. 44(1), pp. 185–204, doi:10.1016/S1571-0661(04)80908-3.
  10. J. Hughes & B. Jacobs (2004): Simulations in coalgebra. Theor. Comput. Sci. 327(1-2), pp. 71–108, doi:10.1016/j.tcs.2004.07.022.
  11. B. Jacobs (2016): Introduction to Coalgebra: Towards Mathematics of States and Observation. Cambridge Tracts in Theoretical Computer Science 59. Cambridge University Press, doi:10.1017/CBO9781316823187.
  12. B. Jacobs & J. Rutten (2011): An introduction to (co)algebras and (co)induction.. In: Advanced Topics in Bisimulation and Coinduction. Cambridge University Press, pp. 38–99, doi:10.1017/CBO9780511792588.003.
  13. P. T. Johnstone (1975): Adjoint lifting theorems for categories of algebras. Bulletin of the London Mathematical Society 7(3), pp. 294–297, doi:10.1112/blms/7.3.294.
  14. B. Klin (2009): Structural Operational Semantics for Weighted Transition Systems. In: J. Palsberg: Semantics and Algebraic Specification, LNCS 5700. Springer, pp. 121–139, doi:10/cxqzcf.
  15. B. Klin (2011): Bialgebras for structural operational semantics: An introduction. TCS 412(38), pp. 5043–5069, doi:10.1016/j.tcs.2011.03.023.
  16. B. Klin & B. Nachyła (2014): Distributive Laws and Decidable Properties of SOS Specifications. In: Johannes Borgström & Silvia Crafa: Proc. EXPRESS/SOS 2014, EPTCS 160, pp. 79–93, doi:10.4204/EPTCS.160.8.
  17. B. Klin & B. Nachyła (2017): Some undecidable properties of SOS specifications. J. Log. Algebr. Meth. Program. 87, pp. 94–109, doi:10.1016/j.jlamp.2016.08.005.
  18. J. Power & H. Watanabe (2002): Combining a monad and a comonad. Theor. Comput. Sci. 280(1-2), pp. 137–162, doi:10.1016/S0304-3975(01)00024-X.
  19. J. Rot & M. M. Bonsangue (2016): Structural congruence for bialgebraic semantics. J. Log. Algebr. Meth. Program. 85(6), pp. 1268–1291, doi:10.1016/j.jlamp.2016.08.001.
  20. J. J. M. M. Rutten (2000): Universal coalgebra: a theory of systems. TCS 249(1), pp. 3–80. Available at http://dx.doi.org/10.1016/S0304-3975(00)00056-6.
  21. S. Staton (2008): General Structural Operational Semantics through Categorical Logic. In: LICS. IEEE Computer Society, pp. 166–177, doi:10.1109/LICS.2008.43.
  22. D. Turi & G. Plotkin (1997): Towards a Mathematical Operational Semantics. In: LICS. IEEE Computer Society, pp. 280–291, doi:10.1109/LICS.1997.614955.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org