Network Invariants in Action

The paper presents the method of network invariants for verifying a wide spectrum of LTL properties, including liveness, of parameterized systems. This method can be applied to establish the validity of the property over a system S(n) for every value of the parameter n. The application of the method...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Kesten, Yonit, Pnueli, Amir, Shahar, Elad, Zuck, Lenore
Format: Buchkapitel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 115
container_issue
container_start_page 101
container_title
container_volume 2421
creator Kesten, Yonit
Pnueli, Amir
Shahar, Elad
Zuck, Lenore
description The paper presents the method of network invariants for verifying a wide spectrum of LTL properties, including liveness, of parameterized systems. This method can be applied to establish the validity of the property over a system S(n) for every value of the parameter n. The application of the method requires checking abstraction relations between two finite-state systems. We present a proof rule, based on the method of Abstraction Mapping by Abadi and Lamport, which has been implemented on the tlv modelc hecker and incorporates both history and prophecy variables. The effectiveness of the network invariant method is illustrated on several examples, including a deterministic and probabilistic versions of the dining-philosophers problem.
doi_str_mv 10.1007/3-540-45694-5_8
format Book Chapter
fullrecord <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_14614218</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3072814_13_114</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2288-a8a009104f03aaf0bfc63a15f8f2eca48e245f0be087c3f2b91b5913ff5543cc3</originalsourceid><addsrcrecordid>eNotkLtPAzEMxsNTlNKZhaELY8COk7vcWFU8KlWwwBzlogSOlrsjOUD896QPy5Llzz9_w8fYJcINApS3xJUELlVRSa6MPmDnlIXtrg7ZCAtETiSrIzapSr295abymI2AQPCqlHS64QpZFArUGZuk9AG5SAiB5YhdPfnht4ur6aL9sbGx7ZCmTTuduaHp2gt2Euw6-cl-jtnr_d3L_JEvnx8W89mSOyG05lZbgApBBiBrA9TBFWRRBR2Ed1ZqL6TKsgddOgqirrBWFVIISklyjsbseufb2-TsOkTbuiaZPjafNv4ZlAVKgTpzfMelfGrffDR1162SQTCbuAyZnIDZxmNyXJmnvW_svr59GozfPDjfDtGu3bvtBx-TISiFRmmQDKKkfyxIZY0</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3072814_13_114</pqid></control><display><type>book_chapter</type><title>Network Invariants in Action</title><source>Springer Books</source><creator>Kesten, Yonit ; Pnueli, Amir ; Shahar, Elad ; Zuck, Lenore</creator><contributor>Jancar, Petr ; Kretinsky, Mojmir ; Brim, Lubos ; Kucera, Antonin ; Jančar, Petr ; Kučera, Antonín ; Křetínský, Mojmír ; Brim, Luboš</contributor><creatorcontrib>Kesten, Yonit ; Pnueli, Amir ; Shahar, Elad ; Zuck, Lenore ; Jancar, Petr ; Kretinsky, Mojmir ; Brim, Lubos ; Kucera, Antonin ; Jančar, Petr ; Kučera, Antonín ; Křetínský, Mojmír ; Brim, Luboš</creatorcontrib><description>The paper presents the method of network invariants for verifying a wide spectrum of LTL properties, including liveness, of parameterized systems. This method can be applied to establish the validity of the property over a system S(n) for every value of the parameter n. The application of the method requires checking abstraction relations between two finite-state systems. We present a proof rule, based on the method of Abstraction Mapping by Abadi and Lamport, which has been implemented on the tlv modelc hecker and incorporates both history and prophecy variables. The effectiveness of the network invariant method is illustrated on several examples, including a deterministic and probabilistic versions of the dining-philosophers problem.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540440437</identifier><identifier>ISBN: 3540440437</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540456945</identifier><identifier>EISBN: 9783540456940</identifier><identifier>DOI: 10.1007/3-540-45694-5_8</identifier><identifier>OCLC: 166466505</identifier><identifier>LCCallNum: QA75.5-76.95</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Concrete State ; Exact sciences and technology ; Liveness Property ; Model Check ; Network Invariant ; Programming theory ; Proof Rule ; Theoretical computing</subject><ispartof>CONCUR 2002 - Concurrency Theory, 2002, Vol.2421, p.101-115</ispartof><rights>Springer-Verlag Berlin Heidelberg 2002</rights><rights>2003 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2288-a8a009104f03aaf0bfc63a15f8f2eca48e245f0be087c3f2b91b5913ff5543cc3</citedby><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3072814-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/3-540-45694-5_8$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/3-540-45694-5_8$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,777,778,782,787,788,791,4038,4039,27912,38242,41429,42498</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=14614218$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Jancar, Petr</contributor><contributor>Kretinsky, Mojmir</contributor><contributor>Brim, Lubos</contributor><contributor>Kucera, Antonin</contributor><contributor>Jančar, Petr</contributor><contributor>Kučera, Antonín</contributor><contributor>Křetínský, Mojmír</contributor><contributor>Brim, Luboš</contributor><creatorcontrib>Kesten, Yonit</creatorcontrib><creatorcontrib>Pnueli, Amir</creatorcontrib><creatorcontrib>Shahar, Elad</creatorcontrib><creatorcontrib>Zuck, Lenore</creatorcontrib><title>Network Invariants in Action</title><title>CONCUR 2002 - Concurrency Theory</title><description>The paper presents the method of network invariants for verifying a wide spectrum of LTL properties, including liveness, of parameterized systems. This method can be applied to establish the validity of the property over a system S(n) for every value of the parameter n. The application of the method requires checking abstraction relations between two finite-state systems. We present a proof rule, based on the method of Abstraction Mapping by Abadi and Lamport, which has been implemented on the tlv modelc hecker and incorporates both history and prophecy variables. The effectiveness of the network invariant method is illustrated on several examples, including a deterministic and probabilistic versions of the dining-philosophers problem.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Concrete State</subject><subject>Exact sciences and technology</subject><subject>Liveness Property</subject><subject>Model Check</subject><subject>Network Invariant</subject><subject>Programming theory</subject><subject>Proof Rule</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540440437</isbn><isbn>3540440437</isbn><isbn>3540456945</isbn><isbn>9783540456940</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2002</creationdate><recordtype>book_chapter</recordtype><recordid>eNotkLtPAzEMxsNTlNKZhaELY8COk7vcWFU8KlWwwBzlogSOlrsjOUD896QPy5Llzz9_w8fYJcINApS3xJUELlVRSa6MPmDnlIXtrg7ZCAtETiSrIzapSr295abymI2AQPCqlHS64QpZFArUGZuk9AG5SAiB5YhdPfnht4ur6aL9sbGx7ZCmTTuduaHp2gt2Euw6-cl-jtnr_d3L_JEvnx8W89mSOyG05lZbgApBBiBrA9TBFWRRBR2Ed1ZqL6TKsgddOgqirrBWFVIISklyjsbseufb2-TsOkTbuiaZPjafNv4ZlAVKgTpzfMelfGrffDR1162SQTCbuAyZnIDZxmNyXJmnvW_svr59GozfPDjfDtGu3bvtBx-TISiFRmmQDKKkfyxIZY0</recordid><startdate>2002</startdate><enddate>2002</enddate><creator>Kesten, Yonit</creator><creator>Pnueli, Amir</creator><creator>Shahar, Elad</creator><creator>Zuck, Lenore</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2002</creationdate><title>Network Invariants in Action</title><author>Kesten, Yonit ; Pnueli, Amir ; Shahar, Elad ; Zuck, Lenore</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2288-a8a009104f03aaf0bfc63a15f8f2eca48e245f0be087c3f2b91b5913ff5543cc3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2002</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Concrete State</topic><topic>Exact sciences and technology</topic><topic>Liveness Property</topic><topic>Model Check</topic><topic>Network Invariant</topic><topic>Programming theory</topic><topic>Proof Rule</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kesten, Yonit</creatorcontrib><creatorcontrib>Pnueli, Amir</creatorcontrib><creatorcontrib>Shahar, Elad</creatorcontrib><creatorcontrib>Zuck, Lenore</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kesten, Yonit</au><au>Pnueli, Amir</au><au>Shahar, Elad</au><au>Zuck, Lenore</au><au>Jancar, Petr</au><au>Kretinsky, Mojmir</au><au>Brim, Lubos</au><au>Kucera, Antonin</au><au>Jančar, Petr</au><au>Kučera, Antonín</au><au>Křetínský, Mojmír</au><au>Brim, Luboš</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Network Invariants in Action</atitle><btitle>CONCUR 2002 - Concurrency Theory</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2002</date><risdate>2002</risdate><volume>2421</volume><spage>101</spage><epage>115</epage><pages>101-115</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540440437</isbn><isbn>3540440437</isbn><eisbn>3540456945</eisbn><eisbn>9783540456940</eisbn><abstract>The paper presents the method of network invariants for verifying a wide spectrum of LTL properties, including liveness, of parameterized systems. This method can be applied to establish the validity of the property over a system S(n) for every value of the parameter n. The application of the method requires checking abstraction relations between two finite-state systems. We present a proof rule, based on the method of Abstraction Mapping by Abadi and Lamport, which has been implemented on the tlv modelc hecker and incorporates both history and prophecy variables. The effectiveness of the network invariant method is illustrated on several examples, including a deterministic and probabilistic versions of the dining-philosophers problem.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/3-540-45694-5_8</doi><oclcid>166466505</oclcid><tpages>15</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof CONCUR 2002 - Concurrency Theory, 2002, Vol.2421, p.101-115
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_14614218
source Springer Books
subjects Applied sciences
Computer science
control theory
systems
Concrete State
Exact sciences and technology
Liveness Property
Model Check
Network Invariant
Programming theory
Proof Rule
Theoretical computing
title Network Invariants in Action
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T21%3A47%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Network%20Invariants%20in%20Action&rft.btitle=CONCUR%202002%20-%20Concurrency%20Theory&rft.au=Kesten,%20Yonit&rft.date=2002&rft.volume=2421&rft.spage=101&rft.epage=115&rft.pages=101-115&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540440437&rft.isbn_list=3540440437&rft_id=info:doi/10.1007/3-540-45694-5_8&rft_dat=%3Cproquest_pasca%3EEBC3072814_13_114%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540456945&rft.eisbn_list=9783540456940&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3072814_13_114&rft_id=info:pmid/&rfr_iscdi=true