The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments (Q4982126): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.entcs.2009.02.041 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066955594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Modal Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments / 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: Satisfiability problems for propositional calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log Space Recognition and Translation of Parenthesis Languages / 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: Logic for Programming, Artificial Intelligence, and Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal satisfiability for propositional calculi and constraint satisfaction problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating All Solutions for Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of propositional linear temporal logics / rank
 
Normal rank

Latest revision as of 21:56, 9 July 2024

scientific article; zbMATH DE number 6418746
Language Label Description Also known as
English
The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments
scientific article; zbMATH DE number 6418746

    Statements

    The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 March 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    linear temporal logic
    0 references
    model checking
    0 references
    0 references