A linear-time model-checking algorithm for the alternation-free modal mu- calculus (Q1801498): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Automatic verification of finite-state concurrent systems using temporal logic specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3792217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lattice-theoretical fixpoint theorem and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm to solve fixed-point equations on transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tableau-based model checking in the propositional mu-calculus / rank
 
Normal rank

Latest revision as of 17:22, 17 May 2024

scientific article
Language Label Description Also known as
English
A linear-time model-checking algorithm for the alternation-free modal mu- calculus
scientific article

    Statements

    A linear-time model-checking algorithm for the alternation-free modal mu- calculus (English)
    0 references
    0 references
    0 references
    0 references
    17 August 1993
    0 references
    0 references
    automated verification
    0 references
    model-checking algorithms
    0 references
    automated verification tools for finite-state processes
    0 references