LTL over integer periodicity constraints (Q2503321): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / 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.tcs.2006.02.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2152132130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of temporal proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time logics: Complexity and expressiveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A really temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Symbolic Representations for Arithmetic Constraints in Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation, reasoning, and relational structures: a hybrid logic manifesto / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logics in Artificial Intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding properties of integral relational automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4514735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing and Reasoning about Temporal Granularities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presburger liveness verification of discrete timed automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4415249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2005 – Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Expressive Power of Temporal Logic of Actions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decision Procedure for the First Order Theory of Real Addition with Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4415251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal Logics Between Propositional and First-order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-dimensional modal logics: theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2003 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups, Presburger formulas, and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of modal and temporal logics with reference pointers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of symbolic transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4738225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5536619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the interpretability of arithmetic in temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4778773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NEXP TIME-complete description logics with concrete domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Reasoning with Analytic Tableaux and Related Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4493899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precise interprocedural analysis through linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calendar Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to constraint databases / 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: Q5807665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Datalog with integer periodicity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility of an algorithm for the decision problem in finite classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about infinite computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal logic can be more expressive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518891 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:23, 24 June 2024

scientific article
Language Label Description Also known as
English
LTL over integer periodicity constraints
scientific article

    Statements

    LTL over integer periodicity constraints (English)
    0 references
    14 September 2006
    0 references
    Presburger LTL
    0 references
    periodicity constraints
    0 references
    computational complexity
    0 references
    Büchi automaton
    0 references
    QBF
    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

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references