Symbolic Model Checking in Non-Boolean Domains (Q3176389): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: CONCUR 2003 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2003 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking discounted temporal properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent reachability games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative solution of omega-regular games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game Refinement Relations and Metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on quantifier elimination over real closed fields and applications to constraint databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Quality in Synthesis through Quantitative Objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of Reactive(1) designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming with angelic nondeterminism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The modal mu-calculus alternation hierarchy is strict / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic model checking: \(10^{20}\) states and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2005 – Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of quantitative concurrent parity games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Qualitative concurrent parity games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Value Iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of stochastic \(\omega \)-regular games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammar Analysis and Parsing by Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract interpretation and application to logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichains: A New Algorithm for Checking Universality of Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4270063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichains for the Automata-Based Approach to Model-Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichain Algorithms for Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Quantitative Linear Time Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Antichain Algorithm for LTL Realizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichains and compositional algorithms for LTL synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4270068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From pre-historic to post-modern symbolic model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: What's decidable about hybrid automata? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of symbolic transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and fixing faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology and descriptive set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uppaal in a nutshell / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the synthesis of discrete controllers for timed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel determinacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The determinacy of Blackwell games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The octagon abstract domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2892811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5407248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From program verification to program synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / 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: Reasoning about infinite computations / rank
 
Normal rank

Latest revision as of 03:57, 16 July 2024

scientific article
Language Label Description Also known as
English
Symbolic Model Checking in Non-Boolean Domains
scientific article

    Statements

    Symbolic Model Checking in Non-Boolean Domains (English)
    0 references
    0 references
    0 references
    20 July 2018
    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
    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