Taming past LTL and flat counter systems (Q2346416): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Stéphane P. Demri / rank
Normal rank
 
Property / author
 
Property / author: Stéphane P. Demri / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FLATA / rank
 
Normal rank
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.ic.2015.03.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034462340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Positive Integral Solutions of Linear Diophantine Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Acceleration of Ultimately Periodic Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flat Parametric Counter Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Taming Past LTL and Flat Counter Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Verifying Regular Properties on Flat Counter Systems, / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-checking CTL* over flat Presburger counter systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal Logic with Capacity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4415251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Model-Checking Programs with Lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards SMT Model Checking of Array-Based Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Vector Addition Systems with States / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability in Succinct and Parametric One-Counter Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Kripke Structures and LTL / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stuttering principle revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specification in CTL + past for verification in CTL. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Technology for Verification and Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539597 / 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: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stutter-invariant temporal properties are expressible without the next-time operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: The covering and boundedness problems for vector addition systems / 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: Alternating automata: Unifying truth and validity checking for temporal logics / rank
 
Normal rank

Latest revision as of 04:34, 10 July 2024

scientific article
Language Label Description Also known as
English
Taming past LTL and flat counter systems
scientific article

    Statements

    Taming past LTL and flat counter systems (English)
    0 references
    0 references
    0 references
    0 references
    1 June 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    linear-time temporal logic
    0 references
    stuttering
    0 references
    model-checking
    0 references
    counter system
    0 references
    flatness
    0 references
    complexity
    0 references
    system of equations
    0 references
    small solution
    0 references
    Presburger arithmetic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references