Stochastic Model Checking with Stochastic Comparison

This paper presents a stochastic comparison based method to check state formulas defined over Discrete Time Markov Reward Models. High-level specifications like stochastic Petri nets, Stochastic Automata Networks, Stochastic Process Algebras have been developed to construct large Markov models. Howe...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Pekergin, Nihal, Younès, Sana
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 123
container_issue
container_start_page 109
container_title
container_volume
creator Pekergin, Nihal
Younès, Sana
description This paper presents a stochastic comparison based method to check state formulas defined over Discrete Time Markov Reward Models. High-level specifications like stochastic Petri nets, Stochastic Automata Networks, Stochastic Process Algebras have been developed to construct large Markov models. However computation of transient and steady-state distributions are limited to relatively small parameter sizes because of the state space explosion problem. Stochastic comparison technique by which both transient and steady-state bounding distributions can be computed, lets to overcome this problem. On the other hand, bounding techniques are useful in Model Checking, since we check generally formulas to see if they meet some bounds or not. We propose to apply stochastic bounding algorithms to construct bounding distributions and to check formulas through these distributions.
doi_str_mv 10.1007/11549970_9
format Conference Proceeding
fullrecord <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_17199057</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17199057</sourcerecordid><originalsourceid>FETCH-LOGICAL-p218t-29f286db301297eddcd7a35d4ea4f9eee0e6936684de6f03d14a0bcf549a854a3</originalsourceid><addsrcrecordid>eNpNkE1LxDAYhOMXuK578Rf0Inipvm-SNnmPUtYPWPGgnkOapNu6u21pCuK_t8sKOpc5PMPADGNXCLcIoO4QM0mkwNARW5DSIpMgkEDAMZthjpgKIemEXewB1wqQTtlswjwlJcU5W8T4CZMEKsX1jMm3sXO1jWPjkpfOh21S1MFtmnadfDVjnfzDRbfr7dDErr1kZ5XdxrD49Tn7eFi-F0_p6vXxubhfpT1HPaacKq5zXwpATip477yyIvMyWFlRCAFCTiLPtfQhr0B4lBZKV00Trc6kFXN2fejtbXR2Ww22dU00_dDs7PBtUCERZGrK3RxycULtOgym7LpNNAhm_5r5e038AC7lWQ0</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Stochastic Model Checking with Stochastic Comparison</title><source>Springer Books</source><creator>Pekergin, Nihal ; Younès, Sana</creator><contributor>Bravetti, Mario ; Kloul, Leïla ; Zavattaro, Gianluigi</contributor><creatorcontrib>Pekergin, Nihal ; Younès, Sana ; Bravetti, Mario ; Kloul, Leïla ; Zavattaro, Gianluigi</creatorcontrib><description>This paper presents a stochastic comparison based method to check state formulas defined over Discrete Time Markov Reward Models. High-level specifications like stochastic Petri nets, Stochastic Automata Networks, Stochastic Process Algebras have been developed to construct large Markov models. However computation of transient and steady-state distributions are limited to relatively small parameter sizes because of the state space explosion problem. Stochastic comparison technique by which both transient and steady-state bounding distributions can be computed, lets to overcome this problem. On the other hand, bounding techniques are useful in Model Checking, since we check generally formulas to see if they meet some bounds or not. We propose to apply stochastic bounding algorithms to construct bounding distributions and to check formulas through these distributions.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540287019</identifier><identifier>ISBN: 9783540287018</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540319030</identifier><identifier>EISBN: 3540319034</identifier><identifier>DOI: 10.1007/11549970_9</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Atomic Proposition ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Computer systems performance. Reliability ; Discrete Time Markov Chain ; Exact sciences and technology ; Markov Chain ; Packet Loss ; Software ; State Formula</subject><ispartof>Formal Techniques for Computer Systems and Business Processes, 2005, p.109-123</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11549970_9$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11549970_9$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4035,4036,27904,38234,41421,42490</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=17199057$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Bravetti, Mario</contributor><contributor>Kloul, Leïla</contributor><contributor>Zavattaro, Gianluigi</contributor><creatorcontrib>Pekergin, Nihal</creatorcontrib><creatorcontrib>Younès, Sana</creatorcontrib><title>Stochastic Model Checking with Stochastic Comparison</title><title>Formal Techniques for Computer Systems and Business Processes</title><description>This paper presents a stochastic comparison based method to check state formulas defined over Discrete Time Markov Reward Models. High-level specifications like stochastic Petri nets, Stochastic Automata Networks, Stochastic Process Algebras have been developed to construct large Markov models. However computation of transient and steady-state distributions are limited to relatively small parameter sizes because of the state space explosion problem. Stochastic comparison technique by which both transient and steady-state bounding distributions can be computed, lets to overcome this problem. On the other hand, bounding techniques are useful in Model Checking, since we check generally formulas to see if they meet some bounds or not. We propose to apply stochastic bounding algorithms to construct bounding distributions and to check formulas through these distributions.</description><subject>Applied sciences</subject><subject>Atomic Proposition</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Computer systems performance. Reliability</subject><subject>Discrete Time Markov Chain</subject><subject>Exact sciences and technology</subject><subject>Markov Chain</subject><subject>Packet Loss</subject><subject>Software</subject><subject>State Formula</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540287019</isbn><isbn>9783540287018</isbn><isbn>9783540319030</isbn><isbn>3540319034</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkE1LxDAYhOMXuK578Rf0Inipvm-SNnmPUtYPWPGgnkOapNu6u21pCuK_t8sKOpc5PMPADGNXCLcIoO4QM0mkwNARW5DSIpMgkEDAMZthjpgKIemEXewB1wqQTtlswjwlJcU5W8T4CZMEKsX1jMm3sXO1jWPjkpfOh21S1MFtmnadfDVjnfzDRbfr7dDErr1kZ5XdxrD49Tn7eFi-F0_p6vXxubhfpT1HPaacKq5zXwpATip477yyIvMyWFlRCAFCTiLPtfQhr0B4lBZKV00Trc6kFXN2fejtbXR2Ww22dU00_dDs7PBtUCERZGrK3RxycULtOgym7LpNNAhm_5r5e038AC7lWQ0</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Pekergin, Nihal</creator><creator>Younès, Sana</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Stochastic Model Checking with Stochastic Comparison</title><author>Pekergin, Nihal ; Younès, Sana</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p218t-29f286db301297eddcd7a35d4ea4f9eee0e6936684de6f03d14a0bcf549a854a3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Atomic Proposition</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Computer systems performance. Reliability</topic><topic>Discrete Time Markov Chain</topic><topic>Exact sciences and technology</topic><topic>Markov Chain</topic><topic>Packet Loss</topic><topic>Software</topic><topic>State Formula</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Pekergin, Nihal</creatorcontrib><creatorcontrib>Younès, Sana</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Pekergin, Nihal</au><au>Younès, Sana</au><au>Bravetti, Mario</au><au>Kloul, Leïla</au><au>Zavattaro, Gianluigi</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Stochastic Model Checking with Stochastic Comparison</atitle><btitle>Formal Techniques for Computer Systems and Business Processes</btitle><date>2005</date><risdate>2005</risdate><spage>109</spage><epage>123</epage><pages>109-123</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540287019</isbn><isbn>9783540287018</isbn><eisbn>9783540319030</eisbn><eisbn>3540319034</eisbn><abstract>This paper presents a stochastic comparison based method to check state formulas defined over Discrete Time Markov Reward Models. High-level specifications like stochastic Petri nets, Stochastic Automata Networks, Stochastic Process Algebras have been developed to construct large Markov models. However computation of transient and steady-state distributions are limited to relatively small parameter sizes because of the state space explosion problem. Stochastic comparison technique by which both transient and steady-state bounding distributions can be computed, lets to overcome this problem. On the other hand, bounding techniques are useful in Model Checking, since we check generally formulas to see if they meet some bounds or not. We propose to apply stochastic bounding algorithms to construct bounding distributions and to check formulas through these distributions.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11549970_9</doi><tpages>15</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Formal Techniques for Computer Systems and Business Processes, 2005, p.109-123
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_17199057
source Springer Books
subjects Applied sciences
Atomic Proposition
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Computer systems performance. Reliability
Discrete Time Markov Chain
Exact sciences and technology
Markov Chain
Packet Loss
Software
State Formula
title Stochastic Model Checking with Stochastic Comparison
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T11%3A25%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Stochastic%20Model%20Checking%20with%20Stochastic%20Comparison&rft.btitle=Formal%20Techniques%20for%20Computer%20Systems%20and%20Business%20Processes&rft.au=Pekergin,%20Nihal&rft.date=2005&rft.spage=109&rft.epage=123&rft.pages=109-123&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540287019&rft.isbn_list=9783540287018&rft_id=info:doi/10.1007/11549970_9&rft_dat=%3Cpascalfrancis_sprin%3E17199057%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540319030&rft.eisbn_list=3540319034&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true