J. Adámek
H.-E. Porst
2004
On tree coalgebras and coalgebra presentations
Theoretical Computer Science
311
257–283
10.1016/S0304-3975(03)00378-5
S. Andova
S. Georgievska
N. Trčka
2012
Branching bisimulation congruence for probabilistic systems
Theoretical Computer Science
413
58–72
10.1016/j.tcs.2011.07.020
C. Baier
1998
On Algorithmic Verification Methods for Probabilistic Systems
University of Mannheim
Hablitations Thesis
C. Baier
H. Hermanns
J.-P. Katoen
V. Wolf
2006
Bisimulation and Simulation Relations for Markov Chains
Electronic Notes in Theoretical Computer Science
162
73–78
10.1016/j.entcs.2005.12.078
F. Bartels
A. Sokolova
E.P. de Vink
2004
A hierarchy of probabilistic system types
Theoretical Computer Science
327
3–22
10.1016/j.tcs.2004.07.019
M. Bernardo
R. De Nicola
M. Loreti
2013
A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
Information and Computation
225
29–82
10.1016/j.ic.2013.02.004
F. Bonchi
M. Bonsangue
M. Boreale
J. Rutten
A. Silva
2012
A coalgebraic perspective on linear weighted automata
Information and Computation
211
77–105
10.1016/j.ic.2011.12.002
T. Brengos
M. Miculan
M. Peressotti
2014
Behavioural equivalences for coalgebras with unobservable moves
CoRR
abs/1411.0090
http://arxiv.org/abs/1411.0090
S. Crafa
F. Ranzato
2011
A Spectrum of Behavioral Relations over LTSs on Probability Distributions
J.-.P Katoen
B. König
Proc. CONCUR 2011
LNCS 6901
124–139
10.1007/978-3-642-23217-6_9
R. De Nicola
D. Latella
M. Loreti
M. Massink
2009
Rate-based Transition Systems for Stochastic Process Calculi
S. Albers et al.
Proc. ICALP 2009, Part II
LNCS 5556
435–446
10.1007/978-3-642-02930-1_36
R. De Nicola
D. Latella
M. Loreti
M. Massink
2013
A Uniform Definition of Stochastic Process Calculi
ACM Computing Surveys
46
5:1–5:35
10.1145/2522968.2522973
C. Eisentraut
H. Hermanns
Lijun Zhang
2010
Concurrency and Composition in a Stochastic World
P. Gastin
F. Laroussinie
Proc. CONCUR 2010
LNCS 6269
21–39
10.1007/978-3-642-15375-4_3
C. Eisentraut
H. Hermanns
Lijun Zhang
2010
On Probabilistic Automata in Continuous Time
Proc. LICS, Edinburgh
IEEE Computer Society
342–351
M. Hennessy
2012
Exploring probabilistic bisimulations, part I
Formal Aspects of Computing
24
749–768
10.1007/s00165-012-0242-7
H. Hermanns
2002
Interactive Markov Chains: The Quest for Quantified Quality
LNCS 2428
10.1007/3-540-45804-2
H. Hermanns
J.-P. Katoen
20010
The How and Why of Interactive Markov Chains
F.S. de Boer
M.M. Bonsangue
S. Hallerstede
M. Leuschel
Proc. FMCO 2009
LNCS 6286
311–337
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
10.1017/CBO9780511569951
B. Klin
2009
Structural Operational Semantics for Weighted Transition Systems
J. Palsberg
Semantics and Algebraic Specification
LNCS 5700
121–139
10.1007/978-3-642-04164-8_7
B. Klin
V. Sassone
2008
Structural Operational Semantics for Stochastic Process Calculi
R.M. Amadio
Proc. FoSSaCS 2008
LNCS 4962
428–442
10.1007/978-3-540-78499-9_30
A. Kurz
2000
Logics for coalgebras and applications to computer science
LMU München
K.G. Larsen
A. Skou
1991
Bisimulation through Probabilistic Testing
Information and Computation
94
1–28
10.1016/0890-5401(91)90030-6
D. Latella
M. Massink
E.P. de Vink
2013
Coalgebraic Bisimulation of FuTS
Technical Report
TR 09
ASCENS: Autonomic Service-Component Ensembles (EU Proj. 257414)
D. Latella
M. Massink
E.P. de Vink
Bisimulation of Labeled State-to-Function Transition Systems Coalgebraically
Submitted
D. Latella
M. Massink
E.P. de Vink
2012
Bisimulation of Labeled State-to-Function Transition Systems of Stochastic Process Languages
U. Golas
T. Soboll
Proc. ACCAT 2012
EPTSC 93
23–43
10.4204/EPTCS.93.2
M. Miculan
M. Peressotti
2013
Weak bisimulations for labelled transition systems weighted over semirings
CoRR
abs/1310.4106
http://arxiv.org/abs/1310.4106
M. Miculan
M. Peressotti
2014
GSOS for non-deterministic processes with quantitative aspects
N. Bertrand
L. Bortolussi
Proc. QAPL 2014
EPTCS 154
17–33
10.4204/EPTCS.154.2
P. Panangaden
2009
Labelled Markov Processes
Imperial College Press
10.1142/9781848162891
J.J.M.M. Rutten
2000
Universal coalgebra: a theory of systems
Theoretical Computer Science
249
3–80
10.1016/S0304-3975(00)00056-6
R. Segala
N.A. Lynch
1995
Probabilistic Simulations for Probabilistic Processes
Nordic Journal of Computing
2
250–273
A. Sokolova
2011
Probabilistic systems coalgebraically: A survey
Theoretical Computer Science
412
5095–5110
10.1016/j.tcs.2011.05.008
A. Sokolova
E.P. de Vink
H. Woracek
2009
Coalgebraic Weak Bisimulation for Action-Type Systems
Scientific Annals of Computer Science
19
93–144
S. Staton
2011
Relating coalgebraic notions of bisimulation
Logical Methods in Computer Science
7
1–21
10.2168/LMCS-7(1:13)2011
M. Timmer
J.-P. Katoen
J. van de Pol
M. Stoelinga
2012
Efficient Modelling and Generation of Markov Automata
M. Koutny
I. Ulidowski
Proc. CONCUR 2012
LNCS 7454
364–379
10.1007/978-3-642-32940-1_26