메뉴 건너뛰기
Electronic Notes in Theoretical Computer Science
Volumn 65, Issue 1, 2002, Pages 29-53
GSOS for probabilistic transition systems
Author keywords

[No Author keywords available]
Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; MATHEMATICAL OPERATORS; PROBABILITY DISTRIBUTIONS; RECURSIVE FUNCTIONS; SEMANTICS;
EID: 4944243960     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80358-X     Document Type: Conference Paper
Times cited : (34)
References (16)
  • 2
    • 18944404502 scopus 로고    scopus 로고
    • Generalised coinduction
    • Andrea Corradini, Marina Lenisa, and Ugo Montanari, editors, Proc. Coalgebraic Methods in Computer Science (CMCS 2001) Elsevier Science Publishers
    • Falk Bartels. Generalised coinduction. In Andrea Corradini, Marina Lenisa, and Ugo Montanari, editors, Proc. Coalgebraic Methods in Computer Science (CMCS 2001), volume 44 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2001.
    • (2001) Electronic Notes in Theoretical Computer Science , vol.44
    • Bartels, F.1
  • 3
    • 18944373870 scopus 로고    scopus 로고
    • GSOS for probabilistic transition systems
    • CWI, Amsterdam, to appear
    • Falk Bartels. GSOS for probabilistic transition systems. Technical Report SEN-R02, CWI, Amsterdam, to appear 2002.
    • (2002) Technical Report , vol.SEN-R02
    • Bartels, F.1
  • 5
    • 0001437652 scopus 로고    scopus 로고
    • Bisimulation for probabilistic transition systems: A coalgebraic approach
    • de Vink, Rutten. Bisimulation for probabilistic transition systems: A coalgebraic approach. TCS: Theoretical Computer Science. 221:1999
    • (1999) TCS: Theoretical Computer Science , vol.221
    • De Vink1    Rutten2
  • 6
    • 0005411712 scopus 로고    scopus 로고
    • Probabilistic extensions of process algebras
    • A. Jan Bergstra, Alban Ponse, & A. Scott Smolka. Elsevier
    • Jonsson Bengt, Kim Larsen G., Yi Wang. Probabilistic extensions of process algebras. Jan Bergstra A., Ponse Alban, Scott Smolka A. Handbook of Process Algebra. 2001;685-710 Elsevier
    • (2001) Handbook of Process Algebra , pp. 685-710
    • Jonsson, B.1    Kim Larsen, G.2    Yi, W.3
  • 7
    • 0000892681 scopus 로고    scopus 로고
    • A tutorial on (co)algebras and (co)induction
    • Jacobs Bart, Rutten Jan. A tutorial on (co)algebras and (co)induction. Bulletin of the EATCS. 62:1996;222-259
    • (1996) Bulletin of the EATCS , vol.62 , pp. 222-259
    • Jacobs, B.1    Rutten, J.2
  • 8
    • 84869195047 scopus 로고    scopus 로고
    • Bialgebraic modelling of timed processes
    • Lecture Notes in Computer Science. Springer, to appear
    • M. Kick. Bialgebraic modelling of timed processes. In Proceedings ICALP'02, Lecture Notes in Computer Science. Springer, to appear 2002.
    • (2002) Proceedings ICALP'02
    • Kick, M.1
  • 9
    • 18944387191 scopus 로고    scopus 로고
    • Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads
    • Horst Reichel, editor, Proc. Coalgebraic Methods in Computer Science (CMCS 2000) Elsevier Science Publishers
    • Marina Lenisa, John Power, and Hiroshi Watanabe. Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads. In Horst Reichel, editor, Proc. Coalgebraic Methods in Computer Science (CMCS 2000), volume 33 of Electronic Notes in Theoretical Computer Science, pages 233-263. Elsevier Science Publishers, 2000.
    • (2000) Electronic Notes in Theoretical Computer Science , vol.33 , pp. 233-263
    • Lenisa, M.1    Power, J.2    Watanabe, H.3
  • 10
    • 0026222347 scopus 로고
    • Bisimulation through probabilistic testing
    • Kim Larsen G., Skou Arne. Bisimulation through probabilistic testing. Information and Computation. 94:(1):September 1991;1-28
    • (1991) Information and Computation , vol.94 , Issue.1 , pp. 1-28
    • Kim Larsen, G.1    Skou, A.2
  • 11
    • 70349885792 scopus 로고
    • Compositional verification of probabilistic processes
    • W. R. Cleaveland, editor, CONCUR '92: Third International Conference on Concurrency Theory Stony Brook, New York Springer-Verlag
    • Kim G. Larsen and Arne Skou. Compositional verification of probabilistic processes. In W. R. Cleaveland, editor, CONCUR '92: Third International Conference on Concurrency Theory, volume 630 of Lecture Notes in Computer Science, pages 456-471, Stony Brook, New York, 1992. Springer-Verlag.
    • (1992) Lecture Notes in Computer Science , vol.630 , pp. 456-471
    • Larsen, K.G.1    Skou, A.2
  • 12
    • 0001986854 scopus 로고    scopus 로고
    • Universal coalgebra: A theory of systems
    • Rutten Jan. Universal coalgebra: A theory of systems. Theoretical Computer Science. 249:(1):October 2000;3-80
    • (2000) Theoretical Computer Science , vol.249 , Issue.1 , pp. 3-80
    • Rutten, J.1
  • 14
    • 0030684322 scopus 로고    scopus 로고
    • Towards a mathematical operational semantics
    • IEEE, Computer Society Press
    • th LICS Conf., pages 280-291. IEEE, Computer Society Press, 1997.
    • (1997) th LICS Conf. , pp. 280-291
    • Turi, D.1    Plotkin, G.D.2
  • 15
    • 0004083276 scopus 로고    scopus 로고
    • Categorical modelling of structural operational rules: Case studies
    • th CTCS Conf. Springer-Verlag
    • th CTCS Conf., volume 1290 of LNCS, pages 127-146. Springer-Verlag, 1997.
    • (1997) LNCS , vol.1290 , pp. 127-146
    • Turi, D.1
  • 16
    • 0006419926 scopus 로고
    • Smolka, and Bernhard Steffen. Reactive, generative and stratified models of probabilistic processes
    • Rob van Glabbeek J., Scott A. Smolka, and Bernhard Steffen. Reactive, generative and stratified models of probabilistic processes. Information and Computation. 121:(1):15 August 1995;59-80
    • (1995) Information and Computation , vol.121 , Issue.1 , pp. 59-80
    • Rob Van Glabbeek, J.1    Scott, A.2

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.