C. Baier, B.R. Haverkort, H. Hermanns, J.-P. Katoen & M. Siegle (2004):
Validation of Stochastic Systems – A Guide to Current Research.
LNCS 2925,
doi:10.1007/b98484.
J.W. de Bakker & E.P. de Vink (1996):
Control Flow Semantics.
The MIT Press.
M. Bernardo (2007):
A Survey of Markovian Behavioral Equivalences.
In: M. Bernardo & J. Hillston: SFM 2007 Advanced Lectures.
LNCS 4486,
pp. 180–219,
doi:10.1007/978-3-540-72522-0_5.
M. Bernardo & R. Gorrieri (1998):
A tutorial on EMPA: a theory of concurrent processes with non-determinism, priorities, probabilities and time.
Theoretical Computer Science 202(1–2),
pp. 1–54,
doi:10.1016/S0304-3975(97)00127-8.
F. Bonchi, M. Bonsangue, M. Boreale, J. Rutten & A. Silva (2011):
A coalgebraic perspective on linear weighted automata.
Technical Report SEN–1104.
CWI.
31pp.
M. Boreale (2009):
Weighted Bisimulation in Linear Algebraic Form.
In: M. Bravetti & G. Zavattaro: Proc. CONCUR 2009.
LNCS 5710,
pp. 163–177,
doi:10.1007/978-3-642-04081-8_12.
R. De Nicola, D. Latella, M. Loreti & M. Massink (2009):
Rate-based Transition Systems for Stochastic Process Calculi.
In: S. Albers et al.: Proc. ICALP 2009, Part II.
LNCS 5556,
pp. 435–446,
doi:10.1007/978-3-642-02930-1_36.
R. De Nicola, D. Latella, M. Loreti & M. Massink (2011):
State to function labelled transition systems: a uniform framework for defining stochastic process calculi.
Technical Report ISTI-2011-TR-012.
CNR/ISTI.
R. De Nicola, D. Latella & M. Massink (2005):
Formal modeling and quantitative analysis of Klaim-based mobile systems.
In: H. Haddad et al.: Proc. SAC 2005.
ACM,
pp. 428–435,
doi:10.1145/1066677.1066777.
C. Eisentraut, H. Hermanns & L. Zhang (2010):
Concurrency and Composition in a Stochastic World.
In: P. Gastin & F. Laroussinie: Proc. CONCUR 2010.
LNCS 6269,
pp. 21–39,
doi:10.1007/978-3-642-15375-4_3.
H.P. Gumm & T. Schröder (2001):
Products of coalgebras.
Algebra Universalis 46,
pp. 163–185.
H.P. Gumm & T. Schröder (2002):
Coalgebras of bounded type.
Mathematical Structures in Computer Science 12,
pp. 565–578,
doi:10.1017/S0960129501003590.
H. Hermanns (2002):
Interactive Markov Chains.
LNCS 2428,
doi:10.1007/3-540-45804-2.
H. Hermanns, U. Herzog & J.-P. Katoen (2002):
Process algebra for performance evaluation.
Theoretical Computer Science 274(1–2),
pp. 43–87,
doi:10.1016/S0304-3975(00)00305-4.
H. Hermanns, U. Herzog & V. Mertsiotakis (1998):
Stochastic process algebras – between LOTOS and Markov chains.
Computer Networks and ISDN Systems 30,
pp. 901–924,
doi:10.1016/S0169-7552(97)00133-5.
H. Hermanns & J.-P. Katoen (2010):
The How and Why of Interactive Markov Chains.
In: F.S. de Boer, M.M. Bonsangue, S. Hallerstede & M. Leuschel: Proc. FMCO 2009.
LNCS 6286,
pp. 311–337,
doi:10.1007/978-3-642-17071-3_16.
J. Hillston (1996):
A Compositional Approach to Performance Modelling.
Distinguished Dissertations in Computer Science 12.
Cambridge University Press.
J. Hillston (2005):
Process Algebras for Quantitative Analysis.
In: Proc. LICS, Chicago.
IEEE,
pp. 239–248,
doi:10.1109/LICS.2005.35.
B. Klin & V. Sassone (2008):
Structural Operational Semantics for Stochastic Process Calculi.
In: R.M. Amadio: Proc. FoSSaCS 2008.
LNCS 4962,
pp. 428–442,
doi:10.1007/978-3-540-78499-9_30.
A. Kurz (2000):
Logics for coalgebras and applications to computer science.
LMU München.
R. Milner (1980):
A Calculus of Communicating Systems.
LNCS 92,
doi:10.1007/3-540-10235-3.
D. Park (1981):
Concurrency and Automata on Infinite Sequences.
In: Proc. GI-Conference 1981, Karlsruhe.
LNCS 104,
pp. 167–183.
C. Priami (1995):
Stochastic π-calculus.
The Computer Journal 38,
pp. 578–589,
doi:10.1093/comjnl/38.7.578.
J.J.M.M. Rutten (2000):
Universal coalgebra: a theory of systems.
Theoretical Computer Science 249,
pp. 3–80,
doi:10.1016/S0304-3975(00)00056-6.
A. Silva, F. Bonchi, M. Bonsangue & J. Rutten (2011):
Quantitative Kleene coalgebras.
Information and Computation 209(5),
pp. 822–846,
doi:10.1016/j.ic.2010.09.007.
A. Sokolova (2011):
Probabilistic systems coalgebraically: a survey.
Theoretical Computer Science 412(38),
pp. 5095–5110,
doi:10.1016/j.tcs.2011.05.008.
D. Turi & G.D. Plotkin (1997):
Towards a Mathematical Operational Semantics.
In: Proc. LICS 1997, Warsaw.
IEEE,
pp. 280–291,
doi:10.1109/LICS.1999.782615.
E.P. de Vink & J.J.M.M. Rutten (1999):
Bisimulation for probabilistic transition systems: a coalgebraic approach.
Theoretical Computer Science 221,
pp. 271–293,
doi:10.1016/S0304-3975(99)00035-3.