Uniform strategies, rational relations and jumping automata (Q2346407): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Alternating-time temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3083813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy construction for parity games with imperfect information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3165948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information tracking in games on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Counter Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problems among the main subfamilies of rational relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Omega-Regular Games with Imperfect Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Relations Defined by Generalized Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronized rational relations of finite and infinite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, logics, and infinite games. A guide to current research / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of reasoning about knowledge and time. I: Lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: CCS expressions, finite state processes, and three problems of equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: An automata-theoretic approach to branching-time model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Module checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient minimization of deterministic weak \(\omega\)-automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2908843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jumping Automata for Uniform Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GENERAL NOTION OF UNIFORM STRATEGIES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4964721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2005 – Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating automata on infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3509047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for multiplayer noncooperative games of incomplete information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous Omega-Regular Games with Partial Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of two-player games of incomplete information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of concurrent programs: The automata-theoretic framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219045 / 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

Latest revision as of 04:33, 10 July 2024

scientific article
Language Label Description Also known as
English
Uniform strategies, rational relations and jumping automata
scientific article

    Statements

    Uniform strategies, rational relations and jumping automata (English)
    0 references
    0 references
    0 references
    0 references
    1 June 2015
    0 references
    games
    0 references
    imperfect information
    0 references
    uniform strategies
    0 references
    logics of knowledge and time
    0 references
    rational relations
    0 references
    jumping automata
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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