Counter automata and classical logics for data
نویسنده
چکیده
منابع مشابه
Automata and Logics over Signals
We extend some of the classical connections between automata and logic due to Büchi [1] and McNaughton and Papert [2], to languages of finitely varying functions or “signals”. In particular we introduce a natural class of automata for generating finitely varying functions called ST-NFA’s, and show that it coincides in terms of language-definability with a natural monadic second-order logic inte...
متن کاملModel-checking branching-time properties of probabilistic automata and probabilistic one-counter automata
This paper studies the problem of model-checking of probabilistic automaton and probabilistic one-counter automata against probabilistic branching-time temporal logics (PCTL and PCTL∗). We show that it is undecidable for these problems. We first show, by reducing to emptiness problem of probabilistic automata, that the modelchecking of probabilistic finite automata against branching-time tempor...
متن کاملModel checking memoryful linear-time logics over one-counter automata
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL) and for first-order logic with data equality tests (written FO(∼, <,+1)) over one-counter automata. We consider several classes of one-counter automata (mainly deterministic vs. nondeterministic) and several logical fragments (restriction on the number of registers or variables a...
متن کاملCounter Systems for Data Logics
Data logics are logical formalisms that are used to specify properties on structures equipped with data (data words, data trees, runs from counter systems, timed words, etc.). In this survey talk, we shall see how satisfiability problems for such data logics are related to reachability problems for counter systems (including counter automata with errors, vector addition systems with states, etc...
متن کاملA Study of Fuzzy and Many-Valued Logics in Cellular Automata
We consider the effect of the underlying logical structure on the asymptotic behavior of space-time diagrams of elementary Boolean cellular automata by focussing on the important case of Rule 110 and its counterparts under various many-valued logics. In particular we show that for a (continuous) probabilistic logic the corresponding rule, dubbed PCA 110, appears to have space-time diagrams with...
متن کامل