Towards a notion of unsatisfiable and unrealizable cores for LTL (Q433349): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.scico.2010.11.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2149150933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Notion of Unsatisfiable Cores for LTL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic Implementation of Alternating Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient detection of vacuity in temporal model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4494388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coverage metrics for temporal logic model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4885877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Before and after vacuity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4205072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Requirements Validation for Hybrid Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean Abstraction for Temporal Logic Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagnostic Information for Realizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure-preserving clause form translation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of propositional linear temporal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Past is for free: On the complexity of verifying linear temporal properties with past / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Generalized Satisfiability for Linear Temporal Logic / 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: A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimality result for clause form translation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practically useful variants of definitional translations to normal form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clausal temporal resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Methods in Computer-Aided Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4817533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Encodings of Bounded LTL Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2845506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / 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: Q4817549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using branching time temporal logic to synthesize synchronization skeletons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of Communicating Processes from Temporal Logic Specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5725991 / 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: Q4074888 / 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: A Hybrid Algorithm for LTL Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Implication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correct Hardware Design and Verification Methods / 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: Formal Methods in Computer-Aided Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Notion of Vacuous Truth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond vacuity: towards the strongest passing formula / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MUST: Provide a Finer-Grained Explanation of Unsatisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4553254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating Minimal Infeasible Constraint Sets in Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Scalable Algorithm for Minimal Unsatisfiable Core Extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vacuity in Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets resolved / rank
 
Normal rank

Latest revision as of 11:54, 5 July 2024

scientific article
Language Label Description Also known as
English
Towards a notion of unsatisfiable and unrealizable cores for LTL
scientific article

    Statements

    Towards a notion of unsatisfiable and unrealizable cores for LTL (English)
    0 references
    0 references
    13 July 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    unsatisfiable cores
    0 references
    unrealizable cores
    0 references
    temporal logic
    0 references
    LTL
    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