Results 41 to 50 of about 3,411 (291)
Parametric updates in parametric timed automata [PDF]
Logical Methods in Computer Science, 2021 We introduce a new class of Parametric Timed Automata (PTAs) where we allow clocks to be compared to parameters in guards, as in classic PTAs, but also to be updated to parameters.
Étienne André +2 more
doaj +1 more source
An Infinite Automaton Characterization of Double Exponential Time
, 2008 Infinite-state automata are a new invention: they are automata that have an infinite number of states represented by words, transitions defined using rewriting, and with sets of initial and final states.
Torre, Salvatore La +2 more
core +2 more sources
The Language Theory of Bounded Context-Switching
, 2010 Concurrent compositions of recursive programs with finite data are a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form of reachability has become popular in the formal verification ...
Salvatore La Torre +8 more
core +2 more sources
Robust Controller Synthesis in Timed Automata [PDF]
, 2013 We consider the fundamental problem of Büchi acceptance in timed automata in a robust setting. The problem is formalised in terms of controller synthesis: timed automata are equipped with a parametrised game-based semantics that models the possible ...
Reynier, Pierre-Alain +7 more
core +1 more source
Scope-bounded pushdown languages [PDF]
, 2014 We study the formal language theory of multistack push-down automata (Mpa) restricted to computations where a symbol can be popped from a stack S only if it was pushed within a bounded number of contexts of S (scoped Mpa).
Salvatore La Torre +5 more
core +1 more source
A B\"uchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We introduce MSO graph storage types, and call a storage type MSO-expressible if it is isomorphic to some MSO graph storage type. An MSO graph storage type has MSO-definable sets of graphs as storage configurations and as storage transformations.
Joost Engelfriet, Heiko Vogler
doaj +1 more source
A unifying approach for multistack pushdown automata [PDF]
, 2014 We give a general approach to show the closure under complement and decide the emptiness for many classes of multistack visibly pushdown automata (Mvpa). A central notion in our approach is the visibly path-tree, i.e., a stack tree with the encoding of a
Salvatore La Torre +5 more
core +1 more source
Streamability of nested word transductions [PDF]
Logical Methods in Computer Science, 2019 We consider the problem of evaluating in streaming (i.e., in a single left-to-right pass) a nested word transduction with a limited amount of memory. A transduction T is said to be height bounded memory (HBM) if it can be evaluated with a memory that ...
Emmanuel Filiot +3 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 +3 more
core +1 more source
Regular Separability of One Counter Automata [PDF]
Logical Methods in Computer Science, 2019 The regular separability problem asks, for two given languages, if there exists a regular language including one of them but disjoint from the other.
Wojciech Czerwiński, Sławomir Lasota
doaj +1 more source