Model Checking with Strong Fairness

Model Checking with Strong Fairness

In this paper we present a coherent framework for symbolic model checking of linear-time temporal logic (ltl) properties over finite state reactive systems, taking full fairness constraints into consideration. We use the computational model of a fair discrete system (fds) which takes into account bo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Formal methods in system design 2006-01, Vol.28 (1), p.57-84
Hauptverfasser: Kesten, Yonit, Pnueli, Amir, Raviv, Li-On, Shahar, Elad
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 84
container_issue 1
container_start_page 57
container_title Formal methods in system design
container_volume 28
creator Kesten, Yonit
Pnueli, Amir
Raviv, Li-On
Shahar, Elad
description In this paper we present a coherent framework for symbolic model checking of linear-time temporal logic (ltl) properties over finite state reactive systems, taking full fairness constraints into consideration. We use the computational model of a fair discrete system (fds) which takes into account both justice (weak fairness) and compassion (strong fairness). The approach presented here reduces the model-checking problem into the question of whether a given fds is feasible (i.e. has at least one computation).
doi_str_mv 10.1007/s10703-006-4342-y
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_28996674</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>28996674</sourcerecordid><originalsourceid>FETCH-LOGICAL-c276t-22db3f1a33dd213bb07eb5876b15ba566ddaec20f29d58dd11907db3c13755c63</originalsourceid><addsrcrecordid>eNotkD1PwzAURS0EEqHwA9giIbEZ3rNjOxlRRAtSEQMwW_4KDaRNsVOh_HtShene4dw7HEKuEe4QQN0nBAWcAkha8ILR8YRkKBSjJQI7JRlUTNCqFPKcXKT0BQAlSp6Rm5fehy6vN8F9t7vP_LcdNvnbEPupL00bdyGlS3LWmC6Fq_9ckI_l43v9RNevq-f6YU0dU3KgjHnLGzSce8-QWwsqWFEqaVFYI6T03gTHoGGVF6X3iBWoaeKQKyGc5AtyO__uY_9zCGnQ2za50HVmF_pD0qysKilVMYE4gy72KcXQ6H1styaOGkEfdehZh5506KMOPfI_wTNR8g</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28996674</pqid></control><display><type>article</type><title>Model Checking with Strong Fairness</title><source>SpringerLink Journals</source><creator>Kesten, Yonit ; Pnueli, Amir ; Raviv, Li-On ; Shahar, Elad</creator><creatorcontrib>Kesten, Yonit ; Pnueli, Amir ; Raviv, Li-On ; Shahar, Elad</creatorcontrib><description>In this paper we present a coherent framework for symbolic model checking of linear-time temporal logic (ltl) properties over finite state reactive systems, taking full fairness constraints into consideration. We use the computational model of a fair discrete system (fds) which takes into account both justice (weak fairness) and compassion (strong fairness). The approach presented here reduces the model-checking problem into the question of whether a given fds is feasible (i.e. has at least one computation).</description><identifier>ISSN: 0925-9856</identifier><identifier>EISSN: 1572-8102</identifier><identifier>DOI: 10.1007/s10703-006-4342-y</identifier><language>eng</language><ispartof>Formal methods in system design, 2006-01, Vol.28 (1), p.57-84</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c276t-22db3f1a33dd213bb07eb5876b15ba566ddaec20f29d58dd11907db3c13755c63</citedby><cites>FETCH-LOGICAL-c276t-22db3f1a33dd213bb07eb5876b15ba566ddaec20f29d58dd11907db3c13755c63</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Kesten, Yonit</creatorcontrib><creatorcontrib>Pnueli, Amir</creatorcontrib><creatorcontrib>Raviv, Li-On</creatorcontrib><creatorcontrib>Shahar, Elad</creatorcontrib><title>Model Checking with Strong Fairness</title><title>Formal methods in system design</title><description>In this paper we present a coherent framework for symbolic model checking of linear-time temporal logic (ltl) properties over finite state reactive systems, taking full fairness constraints into consideration. We use the computational model of a fair discrete system (fds) which takes into account both justice (weak fairness) and compassion (strong fairness). The approach presented here reduces the model-checking problem into the question of whether a given fds is feasible (i.e. has at least one computation).</description><issn>0925-9856</issn><issn>1572-8102</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><recordid>eNotkD1PwzAURS0EEqHwA9giIbEZ3rNjOxlRRAtSEQMwW_4KDaRNsVOh_HtShene4dw7HEKuEe4QQN0nBAWcAkha8ILR8YRkKBSjJQI7JRlUTNCqFPKcXKT0BQAlSp6Rm5fehy6vN8F9t7vP_LcdNvnbEPupL00bdyGlS3LWmC6Fq_9ckI_l43v9RNevq-f6YU0dU3KgjHnLGzSce8-QWwsqWFEqaVFYI6T03gTHoGGVF6X3iBWoaeKQKyGc5AtyO__uY_9zCGnQ2za50HVmF_pD0qysKilVMYE4gy72KcXQ6H1styaOGkEfdehZh5506KMOPfI_wTNR8g</recordid><startdate>200601</startdate><enddate>200601</enddate><creator>Kesten, Yonit</creator><creator>Pnueli, Amir</creator><creator>Raviv, Li-On</creator><creator>Shahar, Elad</creator><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope></search><sort><creationdate>200601</creationdate><title>Model Checking with Strong Fairness</title><author>Kesten, Yonit ; Pnueli, Amir ; Raviv, Li-On ; Shahar, Elad</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c276t-22db3f1a33dd213bb07eb5876b15ba566ddaec20f29d58dd11907db3c13755c63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kesten, Yonit</creatorcontrib><creatorcontrib>Pnueli, Amir</creatorcontrib><creatorcontrib>Raviv, Li-On</creatorcontrib><creatorcontrib>Shahar, Elad</creatorcontrib><collection>CrossRef</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>Formal methods in system design</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kesten, Yonit</au><au>Pnueli, Amir</au><au>Raviv, Li-On</au><au>Shahar, Elad</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Model Checking with Strong Fairness</atitle><jtitle>Formal methods in system design</jtitle><date>2006-01</date><risdate>2006</risdate><volume>28</volume><issue>1</issue><spage>57</spage><epage>84</epage><pages>57-84</pages><issn>0925-9856</issn><eissn>1572-8102</eissn><abstract>In this paper we present a coherent framework for symbolic model checking of linear-time temporal logic (ltl) properties over finite state reactive systems, taking full fairness constraints into consideration. We use the computational model of a fair discrete system (fds) which takes into account both justice (weak fairness) and compassion (strong fairness). The approach presented here reduces the model-checking problem into the question of whether a given fds is feasible (i.e. has at least one computation).</abstract><doi>10.1007/s10703-006-4342-y</doi><tpages>28</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0925-9856
ispartof Formal methods in system design, 2006-01, Vol.28 (1), p.57-84
issn 0925-9856
1572-8102
language eng
recordid cdi_proquest_miscellaneous_28996674
source SpringerLink Journals
title Model Checking with Strong Fairness
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T04%3A03%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Model%20Checking%20with%20Strong%20Fairness&rft.jtitle=Formal%20methods%20in%20system%20design&rft.au=Kesten,%20Yonit&rft.date=2006-01&rft.volume=28&rft.issue=1&rft.spage=57&rft.epage=84&rft.pages=57-84&rft.issn=0925-9856&rft.eissn=1572-8102&rft_id=info:doi/10.1007/s10703-006-4342-y&rft_dat=%3Cproquest_cross%3E28996674%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=28996674&rft_id=info:pmid/&rfr_iscdi=true