Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition (Q3189650): 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: Deterministic generators and games for Ltl fragments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the menbership problem for functional and multivalued dependencies in relational databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking of probabilistic and nondeterministic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trading Performance for Stability in Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Second‐Order Arithmetic and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Sequential Conditions by Finite-State Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assume-Guarantee Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Systems with LimSup and LimInf Objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring and Synthesizing Systems in Probabilistic Environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesizing Protocols for Digital Contract Signing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of probabilistic verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Code aware resource management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Objective Model Checking of Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An On-Line Edge-Deletion Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of quantifiers is better than number of tape cells / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From linear time to branching time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: AND/OR graph heuristic search methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite games played on finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4205072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supervisory Control of a Class of Discrete Event Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fun with fireWire: A comparative study of formal verification methods applied to the IEEE 1394 root contention protocol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata-Theoretic Model Checking Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Büchi Complementation Saga / 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 00:46, 9 July 2024

scientific article
Language Label Description Also known as
English
Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition
scientific article

    Statements

    Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition (English)
    0 references
    12 September 2014
    0 references
    Büchi objectives
    0 references
    graph games
    0 references
    dynamic graph algorithms
    0 references
    graph algorithms
    0 references
    verification
    0 references
    synthesis
    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