Falk Bartels. GSOS for probabilistic transition systems (extended abstract). In Moss [Mos02]. 193 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
GSOS for probabilistic transition systems (Extended Abstract) - Bartels (2002) (Correct)
....to the probability distribution # #(s) which is then put in all positions i s of the result tuple. It can be shown that all natural transformations # as in (8) arise as convex combinations of these # (for a proof we refer the interested reader to a forthcoming technical report [Bar02]) Theorem 6.3 For a set E and m N, every natural transformation # 13 in (8) arises as X #S,###supp( #S, ##) for some distribution #S, # : S E , where the sum above is to be read pointwise, i.e. X (x) y) X (x) y) 6.3 Bottom up: constructing the ....
.... modification of our compositional proof for the correspondence of abstract GSOS and standard GSOS in the nondeterministic setting, which di#ers from the one step approach sketched by Turi and Plotkin [TP97] We are going to include this proof into the technical report version of 23 this article [Bar02], which will appear soon. The only substantial di#erence lies in the proof of Theorem 6.3, which is considerably more involved than that of the nondeterministic counterpart. The aim of the work reported here was not so much to derive a specification format for one particular kind of ....
Falk Bartels. GSOS for probabilistic transition systems. Technical Report SEN-R02??, CWI, Amsterdam, to appear 2002.
GSOS for probabilistic transition systems (Extended Abstract) - Bartels (2002) (Correct)
....according to the probability distribution (s) which is then put in all positions i 2 s of the result tuple. It can be shown that all natural transformations as in (8) arise as convex combinations of these (for a proof we refer the interested reader to a forthcoming technical report [Bar02]) 13 Theorem 6.3 For a set E and m 2 IN , every natural transformation in (8) arises as hS; i2supp( hS; i) for some distribution 2 D fhS; i j S 2 Part ; S Eg, where the sum above is to be read pointwise, i.e. X (x) y) X (x) y) 6.3 Bottom up: ....
.... modi cation of our compositional proof for the correspondence of abstract GSOS and standard GSOS in the nondeterministic setting, which di ers from the one step approach sketched by Turi and Plotkin [TP97] We are going to include this proof into the technical report version of 23 this article [Bar02], which will appear soon. The only substantial di erence lies in the proof of Theorem 6.3, which is considerably more involved than that of the nondeterministic counterpart. The aim of the work reported here was not so much to derive a speci cation format for one particular kind of ....
Falk Bartels. GSOS for probabilistic transition systems. Technical Report SEN-R02??, CWI, Amsterdam, to appear 2002.
On Generalised Coinduction and Probabilistic Specification.. - Bartels (2004) (3 citations) Self-citation (Bartels) (Correct)
No context found.
Falk Bartels. GSOS for probabilistic transition systems (extended abstract). In Moss [Mos02]. 193
On Generalised Coinduction and Probabilistic Specification.. - Bartels (2004) (3 citations) Self-citation (Bartels) (Correct)
No context found.
Falk Bartels. GSOS for probabilistic transition systems. Technical Report SEN-R0221, CWI, Amsterdam, 2002.
GSOS for Probabilistic Transition Systems - Bartels (2002) (2 citations) Self-citation (Bartels) (Correct)
....technique is valid for them, and that every guarded recursive specification has a solution in some model of a PGSOS specification, and that this solution is determined up to (probabilistic) bisimilarity. This technical report is the full version of the extended abstract presented at CMCS 2002 [Bar02]. It adds the full treatment of the nondeterministic setting as well as several proofs for the probabilistic case, like the one of the representation result mentioned above (Theorem 8.6) 2. Preliminaries and notation We use the categorical notions of a functor, natural transformation, and ....
Falk Bartels. GSOS for probabilistic transition systems (extended abstract). In Larry Moss, editor, Proc. Coalgebraic Methods in Computer Science (CMCS 2002), volume 65 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, June 2002.
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