|
279
|
Universal coalgebra: a theory of systems
– J. J. M. M. Rutten
- 2000
|
|
3
|
On a Functor for Probabilistic Bisimulation and Preservation of Weak Pullbacks
– E. P. De Vink
- 1998
|
|
33
|
A Hierarchy of Probabilistic System Types
– Falk Bartels, Ana Sokolova, Erik de Vink
- 2003
|
|
6
|
Metric semantics for reactive probabilistic processes
– Gethin Josiah Norman
- 1997
|
|
21
|
Comparative branching-time semantics for Markov chains
– Christel Baier, Joost-pieter Katoen, Holger Hermanns, Verena Wolf
- 2003
|
|
1
|
An algorithm to quantify behavioural similarity between probabilistic systems
– Babita Sharma
- 2006
|
|
43
|
Presheaf Models for Concurrency
– Gian Luca Cattani
- 1999
|
|
|
Coalgebraic Specifications in Object-Oriented Programming
– Elena Tsanko
- 2004
|
|
24
|
Hidden Coinduction: Behavioral Correctness Proofs for Objects
– Joseph A. Goguen, Grant Malcolm
- 1999
|
|
3
|
A modal proof theory for final polynomial coalgebras. Theoret
– David Friggens, Robert Goldblatt
|
|
14
|
Components as processes: An exercise in coalgebraic modeling
– L. S. Barbosa
- 2000
|
|
144
|
Reactive, Generative and Stratified Models of Probabilistic Processes
– Rob J. Van Glabbeek, Scott A. Smolka, Bernhard Steffen
- 1990
|
|
2
|
Taking Chances on || and fail: Extending Strong and Probabilistic Bisimulation
– J. I. Den Hartog, E. P. De Vink
- 1999
|
|
1
|
A Companion to Coalgebraic Weak Bisimulation for Action-Type Systems ∗
– Ana Sokolova, Erik Vink, Harald Woracek
|
|
18
|
Priority as Extremal Probability
– Scott A. Smolka, Bernhard Steffen
- 1992
|
|
51
|
Weak Bisimulation for Fully Probabilistic Processes
– Christel Baier, Holger Hermanns
- 1999
|
|
7
|
Coalgebras for Binary Methods
– Hendrik Tews, Inst Theor Informatik, Tu Dresden
- 2000
|
|
9
|
Coalgebras For Binary Methods: Properties Of Bisimulations And Invariants
– Hendrik Tews
- 2001
|
|
39
|
Metrics for Labelled Markov Systems
– Josée Desharnais, Radha Jagadeesan, Vineet Gupta, Prakash Panangaden
- 2001
|
