메뉴 건너뛰기




Volumn 2000-January, Issue , 2000, Pages 221-227

Structured language for specifications of quantitative requirements

Author keywords

Clocks; Information analysis; Logic; Natural languages; Performance analysis; Risk analysis; Specification languages; Stochastic processes; Stochastic systems; System performance

Indexed keywords

CLOCKS; COMPUTATIONAL LINGUISTICS; INFORMATION ANALYSIS; RANDOM PROCESSES; RISK ASSESSMENT; SPECIFICATION LANGUAGES; SPECIFICATIONS; STOCHASTIC SYSTEMS; SYSTEMS ENGINEERING;

EID: 0009414628     PISSN: 15302059     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HASE.2000.895466     Document Type: Conference Paper
Times cited : (8)

References (23)
  • 4
    • 13844307834 scopus 로고    scopus 로고
    • Parallel graph generation algorithms for shared and distributed memory machines
    • Proc. Parallel Computing: Fundamentals, Applications and New directions, Elsevier
    • S. Allmaier, S. Dalibor, D. Kreische, Parallel graph generation algorithms for shared and distributed memory machines, Proc. Parallel Computing: Fundamentals, Applications and New directions, Vol 12 of Advances in Parallel Computing, pp. 581-588, Elsevier, 1998.
    • (1998) Advances in Parallel Computing , vol.12 , pp. 581-588
    • Allmaier, S.1    Dalibor, S.2    Kreische, D.3
  • 7
    • 84957369657 scopus 로고    scopus 로고
    • Verifying continuous time Markov chains
    • Proc. Computer-Aided Verification, Proc. Fourth IEEE Int. High-Assurance System engineering Symposium (HASE'99
    • A. Aziz et al., Verifying continuous time Markov chains, Proc. Computer-Aided Verification, SLNCS 1102, 269-276, 1996. Proc. Fourth IEEE Int. High-Assurance System engineering Symposium (HASE'99
    • (1996) SLNCS , vol.1102 , pp. 269-276
    • Aziz, A.1
  • 9
    • 41149144239 scopus 로고    scopus 로고
    • Approximate symbolic model checking of continuous-time Markov chains
    • Proc. Concurrency Theory
    • C. Baier, J.-P. Katonen, H. Hermanns, Approximate symbolic model checking of continuous-time Markov chains, Proc. Concurrency Theory, SLNCS 16664,pp.146-162, 1999.
    • (1999) SLNCS , vol.16664 , pp. 146-162
    • Baier, C.1    Katonen, J.-P.2    Hermanns, H.3
  • 10
    • 0001470680 scopus 로고
    • Automated generation and analysis of Markov reward models using Stochastic Reward Nets
    • Springer
    • G. Ciardo, et al., Automated generation and analysis of Markov reward models using Stochastic Reward Nets, Linear Algebra, Markov Chains and Queueing Models, Springer , 1992
    • (1992) Linear Algebra, Markov Chains and Queueing Models
    • Ciardo, G.1
  • 14
    • 0028516418 scopus 로고
    • Strategies for incorporating formal specifications in software development
    • M.D Fraser, K. Kumar, V.K. Vaishnavi, Strategies for incorporating formal specifications in software development, Communications of the ACM, Vol 37, pp 74-86,1994
    • (1994) Communications of the ACM , vol.37 , pp. 74-86
    • Fraser, M.D.1    Kumar, K.2    Vaishnavi, V.K.3
  • 15
    • 84949597760 scopus 로고    scopus 로고
    • Expected impulse rewards in Markov regenerative stochastic Petri nets
    • th Conf. Computer Performance Evaluation, Modelling Techniques and Tools
    • th Conf. Computer Performance Evaluation, Modelling Techniques and Tools, SLNCS, 1997.
    • (1997) SLNCS
    • German, F.1
  • 16
    • 84949597761 scopus 로고    scopus 로고
    • SPNL: Processes as language-oriented building blocks of stochastic Petri nets
    • rd Int. Workshop Petri Nets and Performance Models (PNPM'97)
    • rd Int. Workshop Petri Nets and Performance Models (PNPM'97) , SLNCS 1245,1997.
    • (1997) SLNCS , vol.1245
    • German, F.1
  • 17
    • 80455136623 scopus 로고    scopus 로고
    • ProbVerus: Probabilistic Symbolic Model Checking
    • Proc ARTS'99
    • V. Haronas-Garmhause, S. Campos, E. Clarke, ProbVerus: Probabilistic Symbolic Model Checking, Proc ARTS'99,SLNCS 1601, pp. 96-110, 1999.
    • (1999) SLNCS , vol.1601 , pp. 96-110
    • Haronas-Garmhause, V.1    Campos, S.2    Clarke, E.3
  • 18
    • 84949597763 scopus 로고    scopus 로고
    • A markov chain model checker
    • University of Erlangen
    • H. Hermanns, et al. A markov chain model checker, Informatik 7, University of Erlangen, 1999.
    • (1999) Informatik , vol.7
    • Hermanns, H.1
  • 19
    • 84949597764 scopus 로고    scopus 로고
    • University of Erlangen-Nuremberg (FAU-IMMD3), Consortio Pisa Ricerche - Pisa Dependable Computing Centre (PDCC), Technical University of Budapest (TUB-MIT), MID GmbH, INTECS Sistemi S.p.A
    • HIDE: High-level Integrated Design Environment for Dependability, University of Erlangen-Nuremberg (FAU-IMMD3), Consortio Pisa Ricerche - Pisa Dependable Computing Centre (PDCC), Technical University of Budapest (TUB-MIT), MID GmbH, INTECS Sistemi S.p.A.
    • HIDE: High-level Integrated Design Environment for Dependability


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