Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time (Q5505609): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4417910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Encodings of Bounded LTL Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3711745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5317419 / rank
 
Normal rank

Latest revision as of 00:52, 29 June 2024

scientific article; zbMATH DE number 5498396
Language Label Description Also known as
English
Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time
scientific article; zbMATH DE number 5498396

    Statements

    Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time (English)
    0 references
    0 references
    0 references
    0 references
    27 January 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    bounded model checking
    0 references
    bi-infinite words and automata
    0 references
    metric temporal logic
    0 references
    0 references