Reactive synthesis from interval temporal logic specifications
From MaRDI portal
Publication:2062122
DOI10.1016/j.tcs.2021.11.023OpenAlexW3216369617MaRDI QIDQ2062122
Publication date: 22 December 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.11.023
Related Items (1)
Cites Work
- Maintaining knowledge about temporal intervals
- Adding one or more equivalence relations to the interval temporal logic \(\mathsf{AB}\overline{\mathsf{B}}\)
- Interval temporal logics over strongly discrete linear orders: expressiveness and complexity
- On complexity of Ehrenfeucht-Fraïssé games
- Undecidable problems in unreliable computations.
- Verifying lossy channel systems has nonprimitive recursive complexity.
- Decidability of the Interval Temporal Logic $\mathsf{A\bar{A}B\bar{B}}$ over the Rationals
- LTL with the freeze quantifier and register automata
- Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals
- An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic
- Logical Refinements of Church’s Problem
- Synthesis of Communicating Processes from Temporal Logic Specifications
- A propositional modal logic of time intervals
- Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness
- The Church Synthesis Problem with Parameters
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Foundations of Software Science and Computation Structures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Reactive synthesis from interval temporal logic specifications
