Decidability results for metric and layered temporal logics

DOI10.1305/NDJFL/1040046089zbMATH Open0858.03018OpenAlexW2032489844MaRDI QIDQ1815429FDOQ1815429

Alberto Policriti, Angelo Montanari

Publication date: 19 March 1997

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/f31ed54db3d65d509276d20c019179c047dd0902

Recommendations

• Publication:4952306
• Theories of  -layered metric temporal structures: expressiveness and decidability
• Decidable metric logics
• Tools and Algorithms for the Construction and Analysis of Systems
• On the decidability and complexity of Metric Temporal Logic over finite words

zbMATH Keywords

decidabilitytime granularitymetric and layered temporal logics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Real-time logics: Complexity and expressiveness
• Handbook of mathematical logic. With the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, A. S. Troelstra. 2nd printing
• Weak Second‐Order Arithmetic and Finite Automata
• Title not available (Why is that?)
• Combining temporal logic systems
• Title not available (Why is that?)
• Specifying message passing and time-critical systems with temporal logic
• Embedding time granularity in a logical specification language for synchronous real-time systems
• A set-theoretic translation method for polymodal logics
• Title not available (Why is that?)

Cited In (10)

• A two-level temporal logic for evolving specifications.
• Title not available (Why is that?)
• On the relationships between theories of time granularity and the monadic second-order theory of one successor
• On the decidability and complexity of Metric Temporal Logic over finite words
• Decidable metric logics
• Title not available (Why is that?)
• Timer formulas and decidable metric temporal logic
• Definability and decidability of binary predicates for time granularity
• Decidability of logics based on an indeterministic metric tense logic
• On Metric Temporal Łukasiewicz Logic

This page was built for publication: Decidability results for metric and layered temporal logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815429)