More Precise Partition Abstractions (Q5452605): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4536601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4884237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: SPECIFICATION AND VERIFICATION OF CONURRENT SYSTEMS IN CESAR / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating tree automata, parity games, and modal \(\mu\)-calculus / rank
 
Normal rank

Latest revision as of 20:54, 27 June 2024

scientific article; zbMATH DE number 5259433
Language Label Description Also known as
English
More Precise Partition Abstractions
scientific article; zbMATH DE number 5259433

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references