Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Omega-Regular languages"'
Autor:
Vandenhove, Pierre
Publikováno v:
Computer Science and Game Theory [cs.GT]. Université Paris-Saclay; Université de Mons, 2023. English. ⟨NNT : 2023UPASG029⟩
We study two-player zero-sum turn-based games on graphs, a framework of choice in theoretical computer science. Such games model the possibly infinite interaction between a computer system (often called reactive) and its environment. The system, seen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::96702db02b773a738d4bdcf41a54bcfd
https://theses.hal.science/tel-04095220
https://theses.hal.science/tel-04095220
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Leibniz International Proceedings in Informatics
49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), Jul 2022, Paris, France. pp.1868-8969, ⟨10.4230/LIPIcs.ICALP.2022.117⟩
49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), Jul 2022, Paris, France. pp.1868-8969, ⟨10.4230/LIPIcs.ICALP.2022.117⟩
In this paper, we look at good-for-games Rabin automata that recognise a Muller language (a language that is entirely characterised by the set of letters that appear infinitely often in each word). We establish that minimal such automata are exactly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f6773b6fb542846657a3ffe9f7a7c17
Publikováno v:
International Colloquium on Automata, Languages, and Programming, ICALP
International Colloquium on Automata, Languages, and Programming, ICALP, 2021, Glasgow, United Kingdom. ⟨10.4230/LIPIcs.ICALP.2021.123⟩
48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
International Colloquium on Automata, Languages, and Programming, ICALP, 2021, Glasgow, United Kingdom. ⟨10.4230/LIPIcs.ICALP.2021.123⟩
48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
We consider the following question: given an automaton or a game with a Muller condition, how can we efficiently construct an equivalent one with a parity condition? There are several examples of such transformations in the literature, including in t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1c0970138f4b4ff33dd11c773339b71b
https://hal.archives-ouvertes.fr/hal-03473722
https://hal.archives-ouvertes.fr/hal-03473722
Autor:
Angelo Montanari, Pietro Sala
Publikováno v:
Language and Automata Theory and Applications ISBN: 9783642370632
LATA
LATA
In the recent years, interval temporal logics are emerging as a workable alternative to more standard point-based ones. In this paper, we establish an original connection between these logics and ωB-regular languages. First, we provide a logical cha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a5494e1d1188adc4d90e1c55f889899f
http://hdl.handle.net/11562/932443
http://hdl.handle.net/11562/932443
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Ben C. Moszkowski
Interval Temporal Logic (ITL) is an established temporal formalism for reasoning about time periods. For over 25 years, it has been applied in a number of ways and several ITL variants, axiom systems and tools have been investigated. We solve the lon
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f268901f1a04c66e43d7bb6c53fbb24f