E. de Vink, J. Rutten. Bisimulation for probabilistic transition systems: A coalgebraic approach. Proc. ICALP'97, LNCS, 1256:460--470, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Metrics for Labelled Markov Processes - Desharnais, Jagadeesan, al. (2003) (Correct)
....to analyze fractals. His de nition is d( sup f2L j fd fd j where L is the class of bounded Lipschitz functions. This is a metric as opposed to just being a distance function. Metrics for probabilistic processes have been investigated by a few researchers: deVink and Rutten [dVR99] Kwiatkowska and Norman [KN96, KN98] and very recently by van Breugel and Worrell [vBW01b, vBW01a] As remarked before, the suggestion that one should look for a metric is due to Giacalone, Jou and Smolka [GJS90] DeVink and Rutten use ultrametrics as a technical tool for de ning probabilistic ....
E. de Vink and J. J. M. M. Rutten. Bisimulation for probabilistic transition systems: A coalgebraic approach. Theoretical Computer Science, 221(1/2):271-293, June 1999.
Approximating Labelled Markov Processes - Desharnais, Jagadeesan (2000) (4 citations) (Correct)
....probabilistic systems, for example [BLL 96, BdA95, BCHG 97, CY95, HK97] By and large, the above work focuses on discrete state systems. The other investigation that we are aware of apart from our earlier papers [BDEP97, DEP98] into continuous state spaces was by deVink and Rutten [dVR97] They define a probabilistic transition system as a coalgebra of a suitable kind using the Giry monad mentioned above. Unfortunately their work applies to ultrametric spaces and not to metric spaces like the reals. In fact, their published proof [dVR97] that bisimulation is an equivalence ....
....state spaces was by deVink and Rutten [dVR97] They define a probabilistic transition system as a coalgebra of a suitable kind using the Giry monad mentioned above. Unfortunately their work applies to ultrametric spaces and not to metric spaces like the reals. In fact, their published proof [dVR97] that bisimulation is an equivalence relation only works in the discrete case. In some sense, ultrametric spaces are more like discrete spaces than like continuous spaces. Their coalgebraic approach is definitely attractive and it should be interesting to explore whether there is any way of ....
E. de Vink and J. J. M. M. Rutten. Bisimulation for probabilistic transition systems: A coalgebraic approach. In Proceedings of the 24th International Colloquium On Automata Languages And Programming, 1997.
The Demonic Product of Probabilistic Relations - Doberkat (2001) (Correct)
.... i with : S F (S) is a coalgebra, thus coalgebras are diagonal members of a full subcategory of 1l S # F. A bisimulation between the coalgebras hS 1 ; 1 i and hS 2 ; 2 i is a coalgebra hR; i with R S 1 S 2 such that the projections i : R S i satisfy 1 i = F ( i ) In [dVR98], de Rutten and Vink de ne probabilistic bisimulations through relations quite close to the de nition for labelled transition systems given by Milner [Mil80] and the de nition given by Larsen and Skou [LS91] They de ne also bisimulations for a functor similar to P on diagonal objects. They ....
....labelled transition systems given by Milner [Mil80] and the de nition given by Larsen and Skou [LS91] They de ne also bisimulations for a functor similar to P on diagonal objects. They prove the equivalence on ultrametric spaces for what they call z closed relations with a Borel decomposition ([dVR98], Lemma 5.5, Theorem 5.8) 3. Moss [Mos99, Sect. 3] de nes a bisimulation on a coalgebra (rather than for two coalgebras) and he shows that the existence of a bisimulation can be established under rather weak conditions (Prop. 3.10, which he attributes to Aczel and Mendler) Moss works in the ....
E. P. de Vink and J. J. M. M. Rutten. Bisimulation for probabilistic transition systems: a coalgebraic approach. Technical Report SEN-R9825, CWI, Amsterdam, 1998.
Linear Structures for Concurrency in Probabilistic.. - Di Pierro, Wiklicky (2001) (Correct)
....type of axiomatic semantics. This could be especially important in the context of the veri cation of probabilistic systems. Finally, we would like to mention the work on probabilistic process algebras (e.g. 4,31,68,7] for an overview see [38] which covers areas like probabilistic bisimulation [46,18], veri cation of probabilistic systems [5,33] and semantics of probabilistic systems [10,55,42] 7 Conclusions and Further Work In this paper we have presented a generic approach to a denotational semantics for probabilistic concurrent languages which is based on linear structures. We have ....
de Vink, E. P. and J. J. Rutten, Bisimulation for probabilistic transition systems: A coalgebraic approach, Theoretical Computer Science 221 (1999), pp. 271-293.
GSOS for Probabilistic Transition Systems - Bartels (2002) (2 citations) (Correct)
....work We developed a specification format for (reactive) probabilistic transition systems (PTS) as studied by Larsen and Skou [LS91] who also introduced the corresponding notion of a probabilistic bisimulation. These systems were studied from a coalgebraic point of view e.g. by de Vink and Rutten [dVR99] and Moss [Mos99] Larsen and Skou [LS92] furthermore defined a set of basic operators to construct (finite) probabilistic transition systems and stated that probabilistic bisimulation is a congruence for them. A similar set of operators, but this time including recursion, was considered by van ....
Erik de Vink and Jan Rutten. Bisimulation for probabilistic transition systems: A coalgebraic approach. Theoretical Computer Science, 221, 1999.
Probabilistic Automata: System Types, Parallel Composition.. - Sokolova, de Vink Self-citation (De vink) (Correct)
No context found.
E.P. de Vink and J.J.M.M. Rutten, Bisimulation for probabilistic transition systems: a coalgebraic approach, Theoretical Computer Science 221 (1999), 271--293.
Weak Bisimulation for Action-Type Coalgebras - Sokolova, de Vink, Woracek Self-citation (De vink) (Correct)
No context found.
E.P. de Vink and J.J.M.M. Rutten. Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoretical Computer Science, 221:271--293, 1999.
A Hierarchy of Probabilistic System Types - Falk Bartels Ana (2003) (4 citations) Self-citation (De vink) (Correct)
No context found.
E.P. de Vink and J.J.M.M. Rutten. Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoretical Computer Science, 221:271--293, 1999.
On Generalised Coinduction and Probabilistic Specification.. - Bartels (2004) (3 citations) Self-citation (Rutten) (Correct)
No context found.
Erik de Vink and Jan Rutten. Bisimulation for probabilistic transition systems: A coalgebraic approach. Theoretical Computer Science, 221:271--293, 1999.
A note on the completeness of M 1 - De Vi Nk Self-citation (De vink) (Correct)
No context found.
E.P. de Vink and J.J.M.M. Rutten. Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoretical Computer Science, 221:271-293, 1999. 3
A note on the completeness of M 1 - De Vi Nk Self-citation (De vink) (Correct)
No context found.
E.P. de Vink and J.J.M.M. Rutten. Bisimulation for probabilistic transition systems: a coalgebraic approach (extended abstract). In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Proc ICALP'97, pages 460-470. LNCS 1256, 1997.
A Hierarchy of Probabilistic System Types - Bartels, Sokolova, de Vink (2003) (4 citations) Self-citation (De vink) (Correct)
....the uniform coalgebraic treatment helps to clarify the picture and to organize the setting. In earlier work comparison is made between a number of probabilistic process equivalences (see, e.g. GSS95] and categorical formulations of LarsenSkou bisimulation and stochastic bisimulation are given [DEP02,VR99]. In recent work [BSV02] we focused on the relationship between these and various related notions and made a taxonomy of the most prominent types of probabilistic bisimulation. There the coalgebraic framework proved useful already for a unified presentation of the diverse types of systems. In the ....
....and f : X Y a mapping. The map f 1 : Y [0, 1] is given by ( f 1 ) y) f 1 ( y ) It follows that # can be considered as a Set functor mapping f : X Y to # (f ) # (X) # (Y ) given by # (f) f 1 . The functor moreover preserves weak pullbacks (see [Mos99,VR99]) Let G = V, E) be a directed graph with two distinguished vertices src and snk with only outgoing and only incoming edges, respectively, and c : E [0, 1] a capacity function. The graph G is referred to as a network. A flow f for the network G is a function f : E [0, 1] such that (i) for ....
[Article contains additional citation context not shown here]
E.P. de Vink and J.J.M.M. Rutten. Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoretical Computer Science, 221:271--293, 1999.
A Hierarchy of Probabilistic System Types - Bartels, Sokolova, de Vink (2003) (4 citations) Self-citation (De vink) (Correct)
....uniform coalgebraic treatment helps to clarify the picture and to organize the setting. In earlier work comparison is made between a number of probabilistic process equivalences (see, e.g. GSS95] Categorial formulations of Larsen Skou bisimulation and stochastic bisimulation are advocated in [DEP02,VR99]. In recent work we focused on the relationships between these and various related notions and made a taxonomy of the most prominent notions of probabilistic bisimulation. The coalgebraic framework proved useful already in [BSV02] for a unified presentation of the diverse types of systems. In the ....
....# (X) Let : X [0, 1] be a probability distribution and f : X Y a mapping. The map f 1 : Y [0, 1] is given by ( f 1 ) y) f 1 ( y ) It follows that # can be considered as a Set functor mapping f : X Y to # (f ) # (X) # (Y ) given by # (f) f 1 . In [Mos99,VR99] it is shown that # preserves weak pullbacks. Let G = V, E) be a directed graph with two distinguished vertices src and snk with only outgoing and only incoming edges, respectively, and c : E [0, 1] a capacity function. The graph G is referred to as a network. A flow f for the network G is ....
[Article contains additional citation context not shown here]
E.P. de Vink and J.J.M.M. Rutten. Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoretical Computer Science, 221:271--293, 1999.
PROBMELA: a modeling language for communicating.. - Baier, Ciesinski, Größer (2004) (Correct)
No context found.
E. de Vink, J. Rutten. Bisimulation for probabilistic transition systems: A coalgebraic approach. Proc. ICALP'97, LNCS, 1256:460--470, 1997.
Metrics for Action-labelled Quantitative Transition Systems - Deng, Chothia.. (2005) (Correct)
No context found.
E. P. de Vink and J. J. M. M. Rutten. Bisimulation for probabilistic transition systems: A coalgebraic approach. Theoretical Computer Science, 221(1/2):271-- 293, 1999.
Metrics for Action-labelled Quantitative Transition Systems - Deng, Chothia.. (2005) (Correct)
No context found.
E. P. de Vink and J. J. M. M. Rutten. Bisimulation for probabilistic transition systems: A coalgebraic approach. Theoretical Computer Science, 221(1/2):271-- 293, 1999.
Testing for Simulation and Bisimulation in Labelled .. - van Breugel.. (2003) (Correct)
No context found.
E.P. de Vink and J.J.M.M. Rutten. Bisimulation for Probabilistic Transition Systems: a Coalgebraic Approach. Theoretical Computer Science, 221(1/2):271293, June 1999. 29
Modular Construction of Modal Logics - Corina Crstea And (Correct)
No context found.
E. de Vink and J. Rutten. Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoretical Computer Science, 221:271--293, 1999.
Modular Construction of Modal Logics - Corina Crstea And (Correct)
No context found.
E. de Vink and J. Rutten. Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoretical Computer Science, 221:271--293, 1999.
Modular Construction of Modal Logics - Crstea, Pattinson (2004) (Correct)
No context found.
E. de Vink and J. Rutten. Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoret. Comput. Sci., 221:271--293, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC