``Most of leads to undecidability: failure of adding frequencies to LTL
From MaRDI portal
Publication:2233396
Cites work
- scientific article; zbMATH DE number 3624762 (Why is no real title available?)
- scientific article; zbMATH DE number 2038747 (Why is no real title available?)
- scientific article; zbMATH DE number 3229502 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- Affine Parikh automata
- Averaging in LTL
- First-order logic with two variables and unary temporal logic
- LTL over integer periodicity constraints
- Latticed-LTL synthesis in the presence of noisy inputs
- Model-Checking Counting Temporal Logics on Flat Structures
- On the decidability and complexity of Metric Temporal Logic over finite words
- Path logics for querying graphs: combining expressiveness and efficiency
- Real-time logics: Complexity and expressiveness
- Regular Languages Definable by Majority Quantifiers with Two Variables
- Temporal logics in computer science. Finite-state systems
- Temporal specifications with accumulative values
- Two-variable first order logic with counting quantifiers: complexity results
- Two-variable logic with counting and a linear order
- Typed monoids -- an Eilenberg-like theorem for non regular languages
- ``Most of leads to undecidability: failure of adding frequencies to LTL
This page was built for publication: ``Most of leads to undecidability: failure of adding frequencies to LTL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233396)