Model Checking Games (Q4916199): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Rudiments of \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: On logics with two variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification as a complexity measure for logic programming / 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: Q4501540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel determinacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the synthesis of strategies in infinite games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees / rank
 
Normal rank

Revision as of 08:48, 6 July 2024

scientific article; zbMATH DE number 6156007
Language Label Description Also known as
English
Model Checking Games
scientific article; zbMATH DE number 6156007

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references