Timeline for Translation of Counter-free automata into Linear Temporal Logic
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 5, 2021 at 20:57 | answer | added | J.-E. Pin | timeline score: 4 | |
| May 29, 2021 at 20:07 | vote | accept | Nicola Gigante | ||
| May 29, 2021 at 18:51 | answer | added | Shaull | timeline score: 5 | |
| May 29, 2021 at 15:13 | comment | added | Bartosz Bednarczyk | Have you tried to look at translations from counter-free automaton into FO[<]? It is known that LTL = FO[<], so maybe you can find something in this direction. | |
| May 29, 2021 at 13:54 | history | asked | Nicola Gigante | CC BY-SA 4.0 |