References

  1. Giorgio Bacci & Marino Miculan (2012): Structural Operational Semantics for Continuous State Probabilistic Processes. In: Dirk Pattinson & Lutz Schröder: CMCS, Lecture Notes in Computer Science 7399. Springer, pp. 71–89. Available at http://dx.doi.org/10.1007/978-3-642-32784-1_5.
  2. Falk Bartels (2004): On Generalised Coinduction and Probabilistic Specification Formats: Distributive Laws in Coalgebraic Modelling. Ph.D. thesis. CWI, Amsterdam.
  3. Marco Bernardo, Rocco De Nicola & Michele Loreti (2013): A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences. Information and Computation 225, pp. 29–82. Available at http://dx.doi.org/10.1016/j.ic.2013.02.004.
  4. Marco Bernardo & Roberto Gorrieri (1998): A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time. Theoretical Computer Science 202(1-2), pp. 1–54. Available at http://dx.doi.org/10.1016/S0304-3975(97)00127-8.
  5. Bard Bloom, Sorin Istrail & Albert R. Meyer (1995): Bisimulation Can't be Traced. J. ACM 42(1), pp. 232–268. Available at http://doi.acm.org/10.1145/200836.200876.
  6. Tomasz Brengos (2014): On coalgebras with internal moves. CoRR abs/1402.6281. Available at http://arxiv.org/abs/1402.6281.
  7. Muffy Calder, Stephen Gilmore & Jane Hillston (2005): Automatically deriving ODEs from process algebra models of signalling pathways. In: Gordon Plotkin: Proc. CMSB, pp. 204–215.
  8. Luca Cardelli & Radu Mardare (2010): The Measurable Space of Stochastic Processes. In: Proc. QEST. IEEE Computer Society, pp. 171–180. Available at http://dx.doi.org/10.1109/QEST.2010.30.
  9. Rocco De Nicola, Diego Latella, Michele Loreti & Mieke Massink (2013): A uniform definition of stochastic process calculi. ACM Computing Surveys 46(1), pp. 5. Available at http://doi.acm.org/10.1145/2522968.2522973.
  10. Manfred Droste, Werner Kuich & Heiko Vogler (2009): Handbook of weighted automata. Springer. Available at http://dx.doi.org/10.1007/978-3-642-01492-5.
  11. Holger Hermanns, Ulrich Herzog & Joost-Pieter Katoen (2002): Process algebra for performance evaluation. Theoretical Computer Science 274(1-2), pp. 43–87. Available at http://dx.doi.org/10.1016/S0304-3975(00)00305-4.
  12. Jane Hillston (1996): A compositional approach to performance modelling. Cambridge University Press. Available at http://dx.doi.org/10.1017/CBO9780511569951.
  13. Jane Hillston (2005): Process Algebras for Quantitative Analysis. In: LICS. IEEE Computer Society, pp. 239–248. Available at http://dx.doi.org/10.1109/LICS.2005.35.
  14. Bartek Klin (2009): Bialgebraic methods and modal logic in structural operational semantics. Information and Computation 207(2), pp. 237–257. Available at http://dx.doi.org/10.1016/j.ic.2007.10.006.
  15. Bartek Klin (2011): Bialgebras for structural operational semantics: An introduction. Theoretical Computer Science 412(38), pp. 5043–5069. Available at http://dx.doi.org/10.1016/j.tcs.2011.03.023.
  16. Bartek Klin & Vladimiro Sassone (2013): Structural operational semantics for stochastic and weighted transition systems. Information and Computation.
  17. Kim Guldstrand Larsen & Arne Skou (1991): Bisimulation through Probabilistic Testing. Information and Computation 94(1), pp. 1–28. Available at http://dx.doi.org/10.1016/0890-5401(91)90030-6.
  18. Diego Latella, Mieke Massink & Erik P. de Vink (2012): Bisimulation of Labeled State-to-Function Transition Systems of Stochastic Process Languages. In: Ulrike Golas & Thomas Soboll: Proc. ACCAT, Electronic Proceedings in Theoretical Computer Science 93, pp. 23–43. Available at http://dx.doi.org/10.4204/EPTCS.93.2.
  19. Matias David Lee, Daniel Gebler & Pedro R. D'Argenio (2012): Tree rules in probabilistic transition system specifications with negative and quantitative premises. In: Bas Luttik & Michel A. Reniers: EXPRESS/SOS, EPTCS 89, pp. 115–130. Available at http://dx.doi.org/10.4204/EPTCS.89.9.
  20. Marino Miculan & Marco Peressotti (2013): Weak bisimulations for labelled transition systems weighted over semirings. CoRR abs/1310.4106. Available at http://arxiv.org/abs/1310.4106.
  21. Stefan Milius, Lawrence S. Moss & Daniel Schwencke (2013): Abstract GSOS Rules and a Modular Treatment of Recursive Definitions. Logical Methods in Computer Science 9(3). Available at http://dx.doi.org/10.2168/LMCS-9(3:28)2013, http://arxiv.org/abs/1307.2538.
  22. Lawrence S. Moss (1999): Coalgebraic logic. Annals of Pure and Applied Logic 96(1), pp. 277–317. Available at http://dx.doi.org/10.1016/S0168-0072(98)00042-6.
  23. Peter D. Mosses (1999): Foundations of Modular SOS. In: Miroslaw Kutylowski, Leszek Pacholski & Tomasz Wierzbicki: MFCS, Lecture Notes in Computer Science 1672. Springer, pp. 70–80. Available at http://dx.doi.org/10.1007/3-540-48340-3_7.
  24. Corrado Priami (1995): Stochastic pi-Calculus. Comput. J. 38(7), pp. 578–589. Available at http://dx.doi.org/10.1093/comjnl/38.7.578.
  25. Jurriaan Rot & Marcello M. Bonsangue (2014): Combining Bialgebraic Semantics and Equations. In: Anca Muscholl: FoSSaCS, Lecture Notes in Computer Science 8412. Springer, pp. 381–395. Available at http://dx.doi.org/10.1007/978-3-642-54830-7_25.
  26. Jan J. M. M. Rutten (2000): Universal coalgebra: a theory of systems. Theoretical Computer Science 249(1), pp. 3–80. Available at http://dx.doi.org/10.1016/S0304-3975(00)00056-6.
  27. Roberto Segala & Nancy A. Lynch (1995): Probabilistic Simulations for Probabilistic Processes. Nord. J. Comput. 2(2), pp. 250–273.
  28. Chris M. N. Tofts (1990): A Synchronous Calculus of Relative Frequency. In: Jos C. M. Baeten & Jan Willem Klop: CONCUR, Lecture Notes in Computer Science 458. Springer, pp. 467–480. Available at http://dx.doi.org/10.1007/BFb0039078.
  29. Daniele Turi & Gordon Plotkin (1997): Towards a mathematical operational semantics. In: Proc. LICS. IEEE Computer Society Press, pp. 280–291.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org