Timer formulas and decidable metric temporal logic (Q1780454): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Joram Hirschfeld / rank
Normal rank
 
Property / author
 
Property / author: Joram Hirschfeld / 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.2004.12.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079880156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The benefits of relaxing punctuality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time logics: Complexity and expressiveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5525343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decision problem for linear temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4824483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models for reactivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decidability of continuous time specification formalisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of temporal logic over the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic theory of order / rank
 
Normal rank

Latest revision as of 12:31, 10 June 2024

scientific article
Language Label Description Also known as
English
Timer formulas and decidable metric temporal logic
scientific article

    Statements

    Timer formulas and decidable metric temporal logic (English)
    0 references
    0 references
    0 references
    13 June 2005
    0 references
    A quantitative temporal logic is defined that is based on a simple modality within the framework of monadic predicate logic. Its canonical model is the real line. It can be interpreted either by behavior with finite variability or by unrestricted behavior. In both cases decidability and complexity bounds are proved using general theorems from logic. The proof uses a sublanguage of the metric monadic logic of order, the language of timer normal form formulas. Metric formulas are reduced to timer normal form and timer normal form formulas allow elimination of the metric.
    0 references
    0 references
    temporal logic
    0 references
    monadic predicate logic
    0 references
    metric formula
    0 references
    decidability
    0 references
    0 references