InforLorV4, Hal, Corpus, bibRecord, 004F83

Truly On-The-Fly LTL Model Checking

Identifieur interne : 004F83 ( Hal/Corpus ); précédent : 004F82; suivant : 004F84

Truly On-The-Fly LTL Model Checking

Auteurs : Moritz Hammer ; Alexander Knapp ; Stephan Merz

Source :

RBID : Hal:inria-00000753

Abstract

We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized Büchi automaton for the negation of the formula and the emptiness check. Our algorithm first converts the LTL formula into a linear weak alternating automaton; configurations of the alternating automaton correspond to the locations of a generalized Büchi automaton, and a variant of Tarjan's algorithm is used to decide the existence of an accepting run of the product of the transition system and the automaton. Because we avoid an explicit construction of the Büchi automaton, our approach can yield significant improvements in runtime and memory, for large LTL formulas. The algorithm has been implemented within the SPIN model checker, and we present experimental results for some benchmark examples.

Url:

https://hal.inria.fr/inria-00000753

Links to Exploration step

Hal:inria-00000753

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Truly On-The-Fly LTL Model Checking</title>
<author><name sortKey="Hammer, Moritz" sort="Hammer, Moritz" uniqKey="Hammer M" first="Moritz" last="Hammer">Moritz Hammer</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-8045" status="INCOMING"><orgName>Institut für Informatik</orgName>
<orgName type="acronym">IFI-LMU</orgName>
<desc><address><addrLine>Oettingenstr. 67 80538 München</addrLine>
<country key="DE"></country>
</address>
<ref type="url">http://www.ifi.lmu.de/</ref>
</desc>
<listRelation><relation active="#struct-300757" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-300757" type="direct"><org type="institution" xml:id="struct-300757" status="VALID"><orgName>Ludwig Maximilians Universität München</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Knapp, Alexander" sort="Knapp, Alexander" uniqKey="Knapp A" first="Alexander" last="Knapp">Alexander Knapp</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-8045" status="INCOMING"><orgName>Institut für Informatik</orgName>
<orgName type="acronym">IFI-LMU</orgName>
<desc><address><addrLine>Oettingenstr. 67 80538 München</addrLine>
<country key="DE"></country>
</address>
<ref type="url">http://www.ifi.lmu.de/</ref>
</desc>
<listRelation><relation active="#struct-300757" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-300757" type="direct"><org type="institution" xml:id="struct-300757" status="VALID"><orgName>Ludwig Maximilians Universität München</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Merz, Stephan" sort="Merz, Stephan" uniqKey="Merz S" first="Stephan" last="Merz">Stephan Merz</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-2357" status="OLD"><idno type="RNSR">200418303G</idno>
<orgName>Proof-oriented development of computer-based systems</orgName>
<orgName type="acronym">MOSEL</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/mosel</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00000753</idno>
<idno type="halId">inria-00000753</idno>
<idno type="halUri">https://hal.inria.fr/inria-00000753</idno>
<idno type="url">https://hal.inria.fr/inria-00000753</idno>
<date when="2005-04">2005-04</date>
<idno type="wicri:Area/Hal/Corpus">004F83</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Truly On-The-Fly LTL Model Checking</title>
<author><name sortKey="Hammer, Moritz" sort="Hammer, Moritz" uniqKey="Hammer M" first="Moritz" last="Hammer">Moritz Hammer</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-8045" status="INCOMING"><orgName>Institut für Informatik</orgName>
<orgName type="acronym">IFI-LMU</orgName>
<desc><address><addrLine>Oettingenstr. 67 80538 München</addrLine>
<country key="DE"></country>
</address>
<ref type="url">http://www.ifi.lmu.de/</ref>
</desc>
<listRelation><relation active="#struct-300757" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-300757" type="direct"><org type="institution" xml:id="struct-300757" status="VALID"><orgName>Ludwig Maximilians Universität München</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Knapp, Alexander" sort="Knapp, Alexander" uniqKey="Knapp A" first="Alexander" last="Knapp">Alexander Knapp</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-8045" status="INCOMING"><orgName>Institut für Informatik</orgName>
<orgName type="acronym">IFI-LMU</orgName>
<desc><address><addrLine>Oettingenstr. 67 80538 München</addrLine>
<country key="DE"></country>
</address>
<ref type="url">http://www.ifi.lmu.de/</ref>
</desc>
<listRelation><relation active="#struct-300757" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-300757" type="direct"><org type="institution" xml:id="struct-300757" status="VALID"><orgName>Ludwig Maximilians Universität München</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Merz, Stephan" sort="Merz, Stephan" uniqKey="Merz S" first="Stephan" last="Merz">Stephan Merz</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-2357" status="OLD"><idno type="RNSR">200418303G</idno>
<orgName>Proof-oriented development of computer-based systems</orgName>
<orgName type="acronym">MOSEL</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/mosel</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="it"><term>Büchi automata</term>
<term>Spin</term>
<term>alternating automata</term>
<term>model checking</term>
<term>temporal logic</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized Büchi automaton for the negation of the formula and the emptiness check. Our algorithm first converts the LTL formula into a linear weak alternating automaton; configurations of the alternating automaton correspond to the locations of a generalized Büchi automaton, and a variant of Tarjan's algorithm is used to decide the existence of an accepting run of the product of the transition system and the automaton. Because we avoid an explicit construction of the Büchi automaton, our approach can yield significant improvements in runtime and memory, for large LTL formulas. The algorithm has been implemented within the SPIN model checker, and we present experimental results for some benchmark examples.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Truly On-The-Fly LTL Model Checking</title>
<author role="aut"><persName><forename type="first">Moritz</forename>
<surname>Hammer</surname>
</persName>
<email></email>
<idno type="halauthor">66748</idno>
<affiliation ref="#struct-8045"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Alexander</forename>
<surname>Knapp</surname>
</persName>
<email></email>
<idno type="halauthor">66749</idno>
<affiliation ref="#struct-8045"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Stephan</forename>
<surname>Merz</surname>
</persName>
<email>Stephan.Merz@loria.fr</email>
<idno type="halauthor">66750</idno>
<affiliation ref="#struct-2357"></affiliation>
</author>
<editor role="depositor"><persName><forename>Stephan</forename>
<surname>Merz</surname>
</persName>
<email>Stephan.Merz@loria.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2005-11-16 12:25:31</date>
<date type="whenModified">2016-05-19 01:09:16</date>
<date type="whenReleased">2005-11-16 13:56:27</date>
<date type="whenProduced">2005-04</date>
<date type="whenEndEmbargoed">2005-11-16</date>
<ref type="file" target="https://hal.inria.fr/inria-00000753/document"><date notBefore="2005-11-16"></date>
</ref>
<ref type="file" n="1" target="https://hal.inria.fr/inria-00000753/file/final.pdf"><date notBefore="2005-11-16"></date>
</ref>
</edition>
<respStmt><resp>contributor</resp>
<name key="104076"><persName><forename>Stephan</forename>
<surname>Merz</surname>
</persName>
<email>Stephan.Merz@loria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">inria-00000753</idno>
<idno type="halUri">https://hal.inria.fr/inria-00000753</idno>
<idno type="halBibtex">hammer:inria-00000753</idno>
<idno type="halRefHtml">Nicolas Halbwachs, Lenore D. Zuck. Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2005), Apr 2005, Edinburgh / U.K., Springer, 3440, pp.191-205, 2005, Lecture Notes in Computer Science</idno>
<idno type="halRef">Nicolas Halbwachs, Lenore D. Zuck. Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2005), Apr 2005, Edinburgh / U.K., Springer, 3440, pp.191-205, 2005, Lecture Notes in Computer Science</idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="LORIA-FM" p="LORIA">Méthodes formelles</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno>
</seriesStmt>
<notesStmt><note type="audience" n="1">Not set</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Truly On-The-Fly LTL Model Checking</title>
<author role="aut"><persName><forename type="first">Moritz</forename>
<surname>Hammer</surname>
</persName>
<idno type="halAuthorId">66748</idno>
<affiliation ref="#struct-8045"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Alexander</forename>
<surname>Knapp</surname>
</persName>
<idno type="halAuthorId">66749</idno>
<affiliation ref="#struct-8045"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Stephan</forename>
<surname>Merz</surname>
</persName>
<email>Stephan.Merz@loria.fr</email>
<idno type="halAuthorId">66750</idno>
<affiliation ref="#struct-2357"></affiliation>
</author>
</analytic>
<monogr><meeting><title>Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2005)</title>
<date type="start">2005-04</date>
<settlement>Edinburgh / U.K.</settlement>
</meeting>
<editor>Nicolas Halbwachs, Lenore D. Zuck</editor>
<imprint><publisher>Springer</publisher>
<biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
<biblScope unit="volume">3440</biblScope>
<biblScope unit="pp">191-205</biblScope>
<date type="datePub">2005-04</date>
</imprint>
</monogr>
<idno type="arxiv">cs.LO/0511061</idno>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="it">model checking</term>
<term xml:lang="it">temporal logic</term>
<term xml:lang="it">alternating automata</term>
<term xml:lang="it">Büchi automata</term>
<term xml:lang="it">Spin</term>
</keywords>
<classCode scheme="acm" n="D.2.4.4"></classCode>
<classCode scheme="acm" n="F.4.3.3"></classCode>
<classCode scheme="halDomain" n="info.info-lo">Computer Science [cs]/Logic in Computer Science [cs.LO]</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized Büchi automaton for the negation of the formula and the emptiness check. Our algorithm first converts the LTL formula into a linear weak alternating automaton; configurations of the alternating automaton correspond to the locations of a generalized Büchi automaton, and a variant of Tarjan's algorithm is used to decide the existence of an accepting run of the product of the transition system and the automaton. Because we avoid an explicit construction of the Büchi automaton, our approach can yield significant improvements in runtime and memory, for large LTL formulas. The algorithm has been implemented within the SPIN model checker, and we present experimental results for some benchmark examples.</abstract>
</profileDesc>
</hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004F83 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 004F83 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Corpus
   |type=    RBID
   |clé=     Hal:inria-00000753
   |texte=   Truly On-The-Fly LTL Model Checking
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Truly On-The-Fly LTL Model Checking

Truly On-The-Fly LTL Model Checking

Source :

Abstract

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri