메뉴 건너뛰기




Volumn 382, Issue 1, 2007, Pages 3-23

Mixing logics and rewards for the component-oriented specification of performance measures

Author keywords

Component oriented modeling; Continuous time Markov chains; Measure specification language; Reward structures; Stochastic process algebra

Indexed keywords

DATA STRUCTURES; FORMAL LOGIC; MARKOV PROCESSES; MATHEMATICAL MODELS; PROGRAM INTERPRETERS;

EID: 34547405268     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.05.006     Document Type: Article
Times cited : (9)

References (29)
  • 1
    • 24944483195 scopus 로고    scopus 로고
    • A methodology based on formal methods for predicting the impact of dynamic power management
    • Formal Methods for Mobile Computing
    • Acquaviva A., Aldini A., Bernardo M., Bogliolo A., Bontà E., and Lattanzi E. A methodology based on formal methods for predicting the impact of dynamic power management. Formal Methods for Mobile Computing. LNCS vol. 3465 (2005) 155-189
    • (2005) LNCS , vol.3465 , pp. 155-189
    • Acquaviva, A.1    Aldini, A.2    Bernardo, M.3    Bogliolo, A.4    Bontà, E.5    Lattanzi, E.6
  • 3
    • 17944367849 scopus 로고    scopus 로고
    • On the usability of process algebra: An architectural view
    • Aldini A., and Bernardo M. On the usability of process algebra: An architectural view. Theoretical Computer Science 335 (2005) 281-329
    • (2005) Theoretical Computer Science , vol.335 , pp. 281-329
    • Aldini, A.1    Bernardo, M.2
  • 4
    • 33750068294 scopus 로고    scopus 로고
    • Component-oriented specification of performance measures
    • Proc. of the 4th Int. Workshop on Quantitative Aspects of Programming Languages, QAPL 2006
    • Aldini A., and Bernardo M. Component-oriented specification of performance measures. Proc. of the 4th Int. Workshop on Quantitative Aspects of Programming Languages, QAPL 2006. ENTCS vol. 164 (2006) 27-43
    • (2006) ENTCS , vol.164 , pp. 27-43
    • Aldini, A.1    Bernardo, M.2
  • 6
    • 41149144239 scopus 로고    scopus 로고
    • Approximate symbolic model checking of continuous time Markov chains
    • Proc. of the 10th Int. Conf. on Concurrency Theory, CONCUR 1999
    • Baier C., Katoen J.-P., and Hermanns H. Approximate symbolic model checking of continuous time Markov chains. Proc. of the 10th Int. Conf. on Concurrency Theory, CONCUR 1999. LNCS vol. 1664 (1999) 146-162
    • (1999) LNCS , vol.1664 , pp. 146-162
    • Baier, C.1    Katoen, J.-P.2    Hermanns, H.3
  • 7
    • 84974622233 scopus 로고    scopus 로고
    • On the logical characterisation of performability properties
    • Proc. of the 27th Int. Coll. on Automata, Languages and Programming, ICALP 2000
    • Baier C., Haverkort B., Hermanns H., and Katoen J.-P. On the logical characterisation of performability properties. Proc. of the 27th Int. Coll. on Automata, Languages and Programming, ICALP 2000. LNCS vol. 1853 (2000) 780-792
    • (2000) LNCS , vol.1853 , pp. 780-792
    • Baier, C.1    Haverkort, B.2    Hermanns, H.3    Katoen, J.-P.4
  • 8
    • 33745715454 scopus 로고    scopus 로고
    • Performance evaluation at the software architecture level
    • Formal Methods for Software Architectures
    • Balsamo S., Bernardo M., and Simeoni M. Performance evaluation at the software architecture level. Formal Methods for Software Architectures. LNCS vol. 2804 (2003) 207-258
    • (2003) LNCS , vol.2804 , pp. 207-258
    • Balsamo, S.1    Bernardo, M.2    Simeoni, M.3
  • 9
    • 34547487432 scopus 로고    scopus 로고
    • M. Bernardo, TwoTowers 5.1 User Manual, http://www.sti.uniurb.it/bernardo/twotowers/, 2006
  • 10
    • 84957797692 scopus 로고    scopus 로고
    • Reward based congruences: Can we aggregate more?
    • Proc. of the Joint Int. Workshop on Process Algebra and Performance Modelling and Probabilistic Methods in Verification, PAPM/PROBMIV 2001
    • Bernardo M., and Bravetti M. Reward based congruences: Can we aggregate more?. Proc. of the Joint Int. Workshop on Process Algebra and Performance Modelling and Probabilistic Methods in Verification, PAPM/PROBMIV 2001. LNCS vol. 2165 (2001) 136-151
    • (2001) LNCS , vol.2165 , pp. 136-151
    • Bernardo, M.1    Bravetti, M.2
  • 11
    • 0037209806 scopus 로고    scopus 로고
    • Performance measure sensitive congruences for Markovian process algebras
    • Bernardo M., and Bravetti M. Performance measure sensitive congruences for Markovian process algebras. Theoretical Computer Science 290 (2003) 117-160
    • (2003) Theoretical Computer Science , vol.290 , pp. 117-160
    • Bernardo, M.1    Bravetti, M.2
  • 12
    • 84957065546 scopus 로고    scopus 로고
    • Stochastic process algebra: From an algebraic formalism to an architectural description language
    • Performance Evaluation of Complex Systems: Techniques and Tools
    • Bernardo M., Donatiello L., and Ciancarini P. Stochastic process algebra: From an algebraic formalism to an architectural description language. Performance Evaluation of Complex Systems: Techniques and Tools. LNCS vol. 2459 (2002) 236-260
    • (2002) LNCS , vol.2459 , pp. 236-260
    • Bernardo, M.1    Donatiello, L.2    Ciancarini, P.3
  • 16
    • 84957644622 scopus 로고    scopus 로고
    • Specifying performance measures for PEPA
    • Proc. of the 5th AMAST Int. Workshop on Formal Methods for Real Time and Probabilistic Systems, ARTS 1999
    • Clark G., Gilmore S., and Hillston J. Specifying performance measures for PEPA. Proc. of the 5th AMAST Int. Workshop on Formal Methods for Real Time and Probabilistic Systems, ARTS 1999. LNCS vol. 1601 (1999) 211-227
    • (1999) LNCS , vol.1601 , pp. 211-227
    • Clark, G.1    Gilmore, S.2    Hillston, J.3
  • 19
    • 34547406317 scopus 로고    scopus 로고
    • Hermanns H. Interactive Markov Chains. LNCS vol. 2428 (2002)
    • (2002) LNCS , vol.2428
    • Hermanns, H.1
  • 23
    • 33244482257 scopus 로고    scopus 로고
    • Model checking expected time and expected reward formulae with random time bounds
    • Kwiatkowska M., Norman G., and Pacheco A. Model checking expected time and expected reward formulae with random time bounds. Computers & Mathematics with Applications 51 (2006) 305-316
    • (2006) Computers & Mathematics with Applications , vol.51 , pp. 305-316
    • Kwiatkowska, M.1    Norman, G.2    Pacheco, A.3
  • 24
    • 84863981780 scopus 로고    scopus 로고
    • PRISM: Probabilistic symbolic model checker
    • Proc. of the 12th Int. Conference on Modelling Techniques and Tools for Computer Performance Evaluation, TOOLS 2002
    • Kwiatkowska M., Norman G., and Parker D. PRISM: Probabilistic symbolic model checker. Proc. of the 12th Int. Conference on Modelling Techniques and Tools for Computer Performance Evaluation, TOOLS 2002. LNCS vol. 2324 (2002) 200-204
    • (2002) LNCS , vol.2324 , pp. 200-204
    • Kwiatkowska, M.1    Norman, G.2    Parker, D.3
  • 26
    • 0028460588 scopus 로고
    • Reward model solution methods with impulse and rate rewards: An algorithm and numerical results
    • Qureshi M.A., and 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
  • 27
    • 0000086137 scopus 로고
    • A unified approach for specifying measures of performance, dependability, and performability
    • Sanders W.H., and Meyer J.F. A unified approach for specifying measures of performance, dependability, and performability. Dependable Computing and Fault Tolerant Systems 4 (1991) 215-237
    • (1991) Dependable Computing and Fault Tolerant Systems , vol.4 , pp. 215-237
    • Sanders, W.H.1    Meyer, J.F.2


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