Results 41 to 50 of about 2,538 (309)

Determinisability of register and timed automata [PDF]

Logical Methods in Computer Science, 2022
The deterministic membership problem for timed automata asks whether the timed language given by a nondeterministic timed automaton can be recognised by a deterministic timed automaton.
Lorenzo Clemente, Sławomir Lasota, Radosław Piórkowski   +2 more
doaj   +1 more source

Regular Languages in the Sliding Window Model [PDF]

TheoretiCS
We study the space complexity of the following problem: For a fixed regular language $L$, we receive a stream of symbols and want to test membership of a sliding window of size $n$ in $L$.
Moses Ganardi, Danny Hucke, Markus Lohrey, Konstantinos Mamouras, Tatiana Starikovskaya   +4 more
doaj   +1 more source

Reasoning about XML with temporal logics and automata [PDF]

, 2010
We show that problems arising in static analysis of XML specifications and transformations can be dealt with using techniques similar to those developed for static analysis of programs Many properties of interest in the XML context are related to ...
Leonid Libkin, Libkin, Leonid, Sirangelo, Cristina, Cristina Sirangelo   +3 more
core   +1 more source

Completing the picture for the Skolem Problem on order-4 linear recurrence sequences [PDF]

TheoretiCS
For almost a century, the decidability of the Skolem Problem - that is, the problem of finding whether a given linear recurrence sequence (LRS) has a zero term - has remained open. A breakthrough in the 1980s established that the Skolem Problem is indeed
Piotr Bacik
doaj   +1 more source

Robustness in Timed Automata [PDF]

, 2013
In this paper we survey several approaches to the robustness of timed automata, that is, the ability of a system to resist to slight perturbations or errors.
Markey, Nicolas, Markey, Nicolas N., Patricia Bouyer, Ocan Sankur, Bouyer, Patricia, Sankur, Ocan, Bouyer, Patricia P., Nicolas Markey   +7 more
core   +1 more source

A Robust Class of Context-Sensitive Languages

, 2007
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolean operations.
MADHUSUDAN P, Torre, Salvatore La, Parlato, Gennaro, SALVATORE LA TORRE, P. MADHUSUDAN, Parthasarathy Madhusudan, Gennaro Parlato, Madhusudan, Parthasarathy, LA TORRE, Salvatore   +8 more
core   +1 more source

Quantitative Automata under Probabilistic Semantics [PDF]

Logical Methods in Computer Science, 2019
Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of quantitative functions,
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop   +2 more
doaj   +1 more source

Performance analysis of probabilistic timed automata using digital clocks [PDF]

, 2006
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a modelling formalism suitable for describing formally both nondeterministic and probabilistic aspects of real-time systems, and is amenable to
Kwiatkowska, M., Parker, D., Norman, G., Sproston, J.   +3 more
core   +1 more source

Unifying B\"uchi Complementation Constructions [PDF]

Logical Methods in Computer Science, 2013
Complementation of B\"uchi automata, required for checking automata containment, is of major theoretical and practical interest in formal verification. We consider two recent approaches to complementation.
Seth J. Fogarty, Orna Kupferman, Thomas Wilke, Moshe Y. Vardi   +3 more
doaj   +1 more source

Regular Tree Algebras [PDF]

Logical Methods in Computer Science, 2020
We introduce a class of algebras that can be used as recognisers for regular tree languages. We show that it is the only such class that forms a pseudo-variety and we prove the existence of syntactic algebras.
Achim Blumensath
doaj   +1 more source