``Most of leads to undecidability: failure of adding frequencies to LTL
From MaRDI portal
Publication:2233396
DOI10.1007/978-3-030-71995-1_5OpenAlexW3151945801MaRDI QIDQ2233396FDOQ2233396
Authors: Bartosz Bednarczyk, Jakub Michaliszyn 
Publication date: 18 October 2021
Full work available at URL: https://arxiv.org/abs/2007.01233
Cites Work
- Title not available (Why is that?)
- Affine Parikh automata
- Real-time logics: Complexity and expressiveness
- On the decidability and complexity of Metric Temporal Logic over finite words
- Latticed-LTL Synthesis in the Presence of Noisy Inputs
- First-order logic with two variables and unary temporal logic
- Typed monoids -- an Eilenberg-like theorem for non regular languages
- Title not available (Why is that?)
- Temporal Specifications with Accumulative Values
- Path Logics for Querying Graphs: Combining Expressiveness and Efficiency
- Title not available (Why is that?)
- LTL over integer periodicity constraints
- Title not available (Why is that?)
- Temporal logics in computer science. Finite-state systems
- Regular Languages Definable by Majority Quantifiers with Two Variables
- Model-Checking Counting Temporal Logics on Flat Structures
- Two-variable first order logic with counting quantifiers: complexity results
- Averaging in LTL
- ``Most of leads to undecidability: failure of adding frequencies to LTL
- Two-variable Logic with Counting and a Linear Order
Cited In (1)
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)
