Path Checking for MTL and TPTL over Data Words (Q3451113): Difference between revisions

From MaRDI portal
Merged Item from Q5367058
ReferenceBot (talk | contribs)
Changed an Item
 
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: Model Checking One-clock Priced Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Temporal-Logic Path Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4994943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability for MTL and TPTL over Non-monotonic Data Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: LTL with the freeze quantifier and register automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking memoryful linear-time logics over one-counter automata / 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: Path Checking for MTL and TPTL over Data Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform constant-depth threshold circuits for division and iterated multiplication. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4738231 / 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: On the decidability and complexity of Metric Temporal Logic over finite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Metric Temporal Logic over Automata with One Counter / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of membership problems for circuits over sets of integers / rank
 
Normal rank

Latest revision as of 01:00, 11 July 2024

scientific article; zbMATH DE number 6790156
Language Label Description Also known as
English
Path Checking for MTL and TPTL over Data Words
scientific article; zbMATH DE number 6790156

    Statements

    Path Checking for MTL and TPTL over Data Words (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2015
    0 references
    12 October 2017
    0 references
    metric temporal logic
    0 references
    times propositional temporal logic
    0 references
    freeze LTL
    0 references
    path checking problem
    0 references
    deterministic one-counter machines
    0 references
    data words
    0 references

    Identifiers

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