Filters
Deeper Connections between LTL and Alternating Automata
as alternating 1-weak automata (A1W automata, also called alternating linear automata or very weak alternating automata). A~translation of LTL formulae into a language equivalentA1W ...
IN - Informatika
- 2005 •
- D
Rok uplatnění
D - Stať ve sborníku
LTL to Büchi Automata: Improved Once Again
We present an improvement of an algorithm translating LTL formulae into Büchi automata via alternating automata. In particular, we improve the transformation of alternating Büchi automata to generalized Bü...
IN - Informatika
- 2010 •
- O
Rok uplatnění
O - Ostatní výsledky
LTL to self-loop alternating automata with generic acceptance and back
Self-loop alternating automata (SLAA) with Buchi or co-Buchi acceptance are popular formalisms also known as very weak alternating automata (VWAA). They are often or nondeterministic automata. This paper c...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2020 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
LTL to Smaller Self-Loop Alternating Automata and Back
Self-loop alternating automata (SLAA) with Büchi or co-Büchi acceptance or nondeterministic automata. This paper considers SLAA with generic transition-based Emerson-Lei acceptance and presents translations of LTL to these ...
Computer and information sciences
- 2019 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
From Spot 2.0 to Spot 2.10: What's New?
, alternating automata, games, LTL synthesis, and more. We also shed some lights on the data-structure used to store automata.$-automata manipulation, with command-line utilities, and Python bindings. This paper wa...
Computer and information sciences
- 2022 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Simplifying Alternating Automata for Emptiness Testing
We propose preprocessing techniques that improve efficiency of testing language emptiness of alternating automata. We target mainly automata that come from practical application such as processing regular expressions, LTL f...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2021 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
A Note on Emptiness for Alternating Finite Automata with a One-Letter Alphabet
We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a proof relying on a series of reductions from several pap...
IN - Informatika
- 2007 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Regulated Pushdown Automata Revisited
This article demonstrates alternative proof of well-known theorem of equivalence between regulated pushdown automata and recursive enumerable languages as shown in Meduna, A., Kolář D.: Regulated Pushdown Automata, Acta Cyb...
JC - Počítačový hardware a software
- 2009 •
- D
Rok uplatnění
D - Stať ve sborníku
ltl3tela: LTL to Small Deterministic or Nondeterministic Emerson-Lei Automata
alternating automata, a pattern-based automata reduction method, and few other heuristics. Experimental evaluation shows that ltl3tela can produce deterministic automata or nondeterministic transition-based Emerso...
Computer and information sciences
- 2019 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Simulations and Aintichains for Efficient Handling of Tree Automata
This work is focused on techniques for finite automata and their use in practice, with the main emphasis on nondeterministic tree automata. This concerns problems that arecrucial for many applications of tree automata. For ...
IN - Informatika
- 2010 •
- B
Rok uplatnění
B - Odborná kniha
- 1 - 10 out of 29 355