Results 1  10
of
51
THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE
, 2013
"... Abstract. The finiteness problem for automaton groups and semigroups has been widely studied, several partial positive results are known. However we prove that, in the most general case, the problem is undecidable. We study the case of automaton semigroups. Given a NWdeterministic Wang tile set, we ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
, we construct a Mealy automaton, such that the plane admit a valid Wang tiling if and only if the Mealy automaton generates a finite semigroup. The construction is similar to a construction by Kari for proving that the nilpotency problem for cellular automata is unsolvable. Moreover Kari proves
Verification of analog and mixedsignal circuits using hybrid systems techniques
 IN FMCAD, LNCS
, 2004
"... In this paper we demonstrate a potential extension of formal verification methodology in order to deal with timedomain properties of analog and mixedsignal circuits whose dynamic behavior is described by differential algebraic equations. To model and analyze such circuits under all possible inpu ..."
Abstract

Cited by 49 (6 self)
 Add to MetaCart
) and apply it to a biquad lowpass filter. To analyze more complex circuits, we resort to bounded horizon verification. We use optimal control techniques to check whether a ∆Σ modulator, modeled as a discretetime hybrid automaton, admits an input sequence of bounded length that drives it to saturation. 1
Fast Synchronization of Random Automata∗
, 2014
"... A synchronizing word for an automaton is a word that brings that automaton into one and the same state, regardless of the starting position. Černy ́ conjectured in 1964 that if a nstate deterministic automaton has a synchronizing word, then it has a synchronizing word of size at most (n − 1)2. Be ..."
Abstract
 Add to MetaCart
)2. Berlinkov recently made a breakthrough in the probabilistic analysis of synchronization by proving that with high probability, an automaton has a synchronizing word. In this article, we prove that with high probability an automaton admits a synchronizing word of length smaller than n1+, and therefore
Learning multiplicity tree automata
 In: Proceedings of the 8th International Colloquium on Grammatical Inference (ICGI’06). Volume 4201 of LNCS
, 2006
"... Abstract. In this paper, we present a theoretical approach for the problem of learning multiplicity tree automata. These automata allows one to define functions which compute a number for each tree. They can be seen as a strict generalization of stochastic tree automata since they allow to define fu ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
functions over any field K. A multiplicity automaton admits a support which is a non deterministic automaton. From a grammatical inference point of view, this paper presents a contribution which is original due to the combination of two important aspects. This is the first time, as far as we now, that a
Task Graph Scheduling using Timed Automata
 Proc. FMPPTA'03
, 2003
"... In this paper we develop a methodology for treating the problem of scheduling partiallyordered tasks on parallel machines. Our framework is based on the timed automaton model, originally developed for verification of realtime programs and digital circuits and more recently adapted for solving time ..."
Abstract

Cited by 27 (4 self)
 Add to MetaCart
timeoptimal scheduling problems. In this framework, the scheduling problem admits a statespace representation and an optimal schedule corresponds to a shortest path in the timed automaton. We check our implementation on numerous benchmarks and show how release times and deadlines can be easily
Regular Gröbner Bases
, 2002
"... In this paper we introduce the concept of biautomaton algebras, generalizing the automaton algebras previously defined by Ufnarovski. A biautomaton algebra is a quotient of the free algebra, defined by a binomial ideal admitting a Gröbner basis which can be encoded as a regular set; we call such a ..."
Abstract
 Add to MetaCart
In this paper we introduce the concept of biautomaton algebras, generalizing the automaton algebras previously defined by Ufnarovski. A biautomaton algebra is a quotient of the free algebra, defined by a binomial ideal admitting a Gröbner basis which can be encoded as a regular set; we call
Chu spaces and their interpretation as concurrent objects
, 2005
"... A Chu space is a binary relation =  from a set A to an antiset X defined as a set which transforms via converse functions. Chu spaces admit a great many interpretations by virtue of realizing all small concrete categories and most large ones arising in mathematical and computational practice. Of pa ..."
Abstract

Cited by 36 (0 self)
 Add to MetaCart
A Chu space is a binary relation =  from a set A to an antiset X defined as a set which transforms via converse functions. Chu spaces admit a great many interpretations by virtue of realizing all small concrete categories and most large ones arising in mathematical and computational practice
Typestate verification: Abstraction techniques and complexity results
 In Proc. of SAS’03, volume 2694 of LNCS
, 2003
"... Abstract. We consider the problem of typestate verification for shallow programs; i.e., programs where pointers from program variables to heapallocated objects are allowed, but where heapallocated objects may not themselves contain pointers. We prove a number of results relating the complexity of ..."
Abstract

Cited by 30 (10 self)
 Add to MetaCart
of verification to the nature of the finite state machine used to specify the property. Some properties are shown to be intractable, but others which appear to be quite similar admit polynomialtime verification algorithms. While there has been much progress on many aspects of automated program verification, we
Inducing an order on cellular automata by a grouping operation
 In STACS'98
, 1998
"... A grouped instance of a cellular automaton (CA) is another one obtained by grouping several states into blocks and by letting interact neighbor blocks. Based on this operation (and on the subautomaton notion), a preorder on the set of one dimensional CA is introduced. It is shown that (CA, ) admits ..."
Abstract

Cited by 23 (5 self)
 Add to MetaCart
A grouped instance of a cellular automaton (CA) is another one obtained by grouping several states into blocks and by letting interact neighbor blocks. Based on this operation (and on the subautomaton notion), a preorder on the set of one dimensional CA is introduced. It is shown that (CA, ) admits
Locally strongly transitive automata and the Hybrid CernyRoad coloring problem
"... Abstract. An independent system of words for a finite automaton is a set of k words taking any state s into k distinct states which do not depend on s. We present some recent application of independent sets to the synchronization problem and to synchronizing colorings of aperiodic graphs. In particu ..."
Abstract
 Add to MetaCart
. In particular, we prove that if an aperiodic, strongly connected digraph of costant outdegree with n vertices has an Hamiltonian path, then it admits a synchronizing coloring with a reset word of length 2(n− 2)(n − 1) + 1. An important concept in Computer Science is that of synchronizing automaton. A
Results 1  10
of
51