메뉴 건너뛰기




Volumn 290, Issue 1, 2003, Pages 117-160

Performance measure sensitive congruences for Markovian process algebras

Author keywords

Markov chains; Mutual exclusion algorithms; Performance evaluation; Process algebras; Rewards

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILITY; QUALITY OF SERVICE;

EID: 0037209806     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00090-1     Document Type: Article
Times cited : (43)

References (36)
  • 2
    • 84974622233 scopus 로고    scopus 로고
    • On the logical characterisation of performability properties
    • Proc. 27th Internat. Colloq. on Automata, Languages and Programming (ICALP '00), Geneve, Switzerland
    • C. Baier, B. Haverkort, H. Hermanns, J.-P. Katoen, On the logical characterisation of performability properties, Proc. 27th Internat. Colloq. on Automata, Languages and Programming (ICALP '00), Lecture Notes in Computer Science, Vol. 1853, Geneve, Switzerland, 2000, pp. 780-792.
    • (2000) Lecture Notes in Computer Science , vol.1853 , pp. 780-792
    • Baier, C.1    Haverkort, B.2    Hermanns, H.3    Katoen, J.-P.4
  • 3
    • 41149144239 scopus 로고    scopus 로고
    • Approximate symbolic model checking of continuous time Markov chains
    • Proc. 10th Internat. Conf. on Concurrency Theory (CONCUR '00), Eindhoven, The Netherlands
    • C. Baier, J.-P. Katoen, H. Hermanns, Approximate symbolic model checking of continuous time Markov chains, Proc. 10th Internat. Conf. on Concurrency Theory (CONCUR '00), Lecture Notes in Computer Science, Vol. 1664, Eindhoven, The Netherlands, 1999, pp. 146-162.
    • (1999) Lecture Notes in Computer Science , vol.1664 , pp. 146-162
    • Baier, C.1    Katoen, J.-P.2    Hermanns, H.3
  • 4
    • 84951159208 scopus 로고    scopus 로고
    • An algebra-based method to associate rewards with EMPA terms
    • Proc. 24th Internat. Colloq. on Automata, Languages and Programming (ICALP '97), Bologna, Italy
    • M. Bernardo, An algebra-based method to associate rewards with EMPA terms, Proc. 24th Internat. Colloq. on Automata, Languages and Programming (ICALP '97), Lecture Notes in Computer Science, Vol. 1256, Bologna, Italy, 1997, pp. 358-368.
    • (1997) Lecture Notes in Computer Science , vol.1256 , pp. 358-368
    • Bernardo, M.1
  • 7
    • 3042628872 scopus 로고    scopus 로고
    • An asynchronous calculus for generative-reactive probabilistic systems
    • Tech. Report UBLCS-2000-03, University of Bologna (Italy), 2000 (extended abstract, Carleton Scientific, Geneva, Switzerland)
    • M. Bravetti, A. Aldini, An asynchronous calculus for generative-reactive probabilistic systems, Tech. Report UBLCS-2000-03, University of Bologna (Italy), 2000 (extended abstract in Proc. 8th Internat. Workshop on Process Algebra and Performance Modelling (PAPM '00), Carleton Scientific, Geneva, Switzerland, 2000, pp. 591-605).
    • (2000) Proc. 8th Internat. Workshop on Process Algebra and Performance Modelling (PAPM '00) , pp. 591-605
    • Bravetti, M.1    Aldini, A.2
  • 8
    • 19144372130 scopus 로고    scopus 로고
    • Compositional asymmetric cooperations for process algebras with probabilities, priorities, and time
    • Tech. Report UBLCS-2000-01, University of Bologna, Italy, 2000 (extended abstract Proc. 1st Internat. Workshop on Models for Time Critical Systems (MTCS '00), State College, PA)
    • M. Bravetti, M. Bernardo, Compositional asymmetric cooperations for process algebras with probabilities, priorities, and time, Tech. Report UBLCS-2000-01, University of Bologna, Italy, 2000 (extended abstract Proc. 1st Internat. Workshop on Models for Time Critical Systems (MTCS '00), Electronic Notes in Theoretical Computer Science, Vol. 39(3), State College, PA, 2000).
    • (2000) Electronic Notes in Theoretical Computer Science , vol.39 , Issue.3
    • Bravetti, M.1    Bernardo, M.2
  • 11
    • 84957644622 scopus 로고    scopus 로고
    • Specifying performance measures for PEPA
    • Proc. 5th AMAST Internat. Workshop on Formal Methods for Real Time and Probabilistic Systems (ARTS '99), Bamberg, Germany
    • G. Clark, S. Gilmore, J. Hillston, Specifying performance measures for PEPA, Proc. 5th AMAST Internat. Workshop on Formal Methods for Real Time and Probabilistic Systems (ARTS '99), Lecture Notes in Computer Science, Vol. 1601, Bamberg, Germany, 1999, pp. 211-227.
    • (1999) Lecture Notes in Computer Science , vol.1601 , pp. 211-227
    • Clark, G.1    Gilmore, S.2    Hillston, J.3
  • 14
    • 84957366381 scopus 로고    scopus 로고
    • The NCSU concurrency workbench
    • Proc. 8th Internat. Conf. on Computer Aided Verification (CAV '96), New Brunswick, NJ
    • W.R. Cleaveland, S. Sims, The NCSU concurrency workbench, Proc. 8th Internat. Conf. on Computer Aided Verification (CAV '96), Lecture Notes in Computer Science, Vol. 1102, New Brunswick, NJ, 1996, pp. 394-397.
    • (1996) Lecture Notes in Computer Science , vol.1102 , pp. 394-397
    • Cleaveland, W.R.1    Sims, S.2
  • 17
    • 0006419926 scopus 로고
    • Reactive, generative and stratified models of probabilistic processes
    • van Glabbeek R.J., Smolka S.A., Steffen B. Reactive, generative and stratified models of probabilistic processes. Inform. Comput. 121:1995;59-80.
    • (1995) Inform. Comput. , vol.121 , pp. 59-80
    • Van Glabbeek, R.J.1    Smolka, S.A.2    Steffen, B.3
  • 20
    • 0003868910 scopus 로고    scopus 로고
    • Ph.D. Thesis, University of Erlangen-Nürnberg, Germany
    • H. Hermanns, Interactive Markov chains, Ph.D. Thesis, University of Erlangen-Nürnberg, Germany, 1998.
    • (1998) Interactive Markov chains
    • Hermanns, H.1
  • 25
    • 0026222347 scopus 로고
    • Bisimulation through probabilistic testing
    • Larsen K.G., Skou A. Bisimulation through probabilistic testing. Inform. Comput. 94:1991;1-28.
    • (1991) Inform. Comput. , vol.94 , pp. 1-28
    • Larsen, K.G.1    Skou, A.2
  • 26
    • 0004215089 scopus 로고    scopus 로고
    • Morgan Kaufmann Publishers, Los Alamos, CA
    • Lynch N.A. Distributed Algorithms. 1996;Morgan Kaufmann Publishers, Los Alamos, CA.
    • (1996) Distributed Algorithms
    • Lynch, N.A.1
  • 27
    • 0000228328 scopus 로고
    • Performability: A retrospective and some pointers to the future
    • Meyer J.F. Performability. a retrospective and some pointers to the future Performance Evaluation. 14:1992;139-156.
    • (1992) Performance Evaluation , vol.14 , pp. 139-156
    • Meyer, J.F.1
  • 29
    • 0028460588 scopus 로고
    • Reward model solution methods with impulse and rate rewards: An algorithm and numerical results
    • Qureshi M.A., Sanders W.H. Reward model solution methods with impulse and rate rewards. an algorithm and numerical results Performance Evaluation. 20:1994;413-436.
    • (1994) Performance Evaluation , vol.20 , pp. 413-436
    • Qureshi, M.A.1    Sanders, W.H.2
  • 30
    • 0000086137 scopus 로고
    • A unified approach for specifying measures of performance, dependability, and performability
    • Sanders W.H., Meyer J.F. A unified approach for specifying measures of performance, dependability, and performability. Dependable Comput. Fault Tolerant Systems. 4:1991;215-237.
    • (1991) Dependable Comput. Fault Tolerant Systems , vol.4 , pp. 215-237
    • Sanders, W.H.1    Meyer, J.F.2
  • 33
    • 0002859997 scopus 로고
    • Processes with probabilities, priority and time
    • Tofts C.M.N. Processes with probabilities, priority and time. Formal Aspects Comput. 6:1994;536-564.
    • (1994) Formal Aspects Comput. , vol.6 , pp. 536-564
    • Tofts, C.M.N.1
  • 36
    • 0031125422 scopus 로고    scopus 로고
    • Composition and behaviors of probabilistic I/O automata
    • Wu S.-H., Smolka S.A., Stark E.W. Composition and behaviors of probabilistic I/O automata. Theoret. Comput. Sci. 176:1997;1-38.
    • (1997) Theoret. Comput. Sci. , vol.176 , pp. 1-38
    • Wu, S.-H.1    Smolka, S.A.2    Stark, E.W.3


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