A methodology for integrating model checking into object-oriented software development processes is defined, developed, and demonstrated. Model checking is applied to object-oriented analysis(OOA) models that have executable semantics specified as state machines rather than as programs in conventional programming languages. The complexity level of an OOA model yields a manageable state space fo...

Unary self-verifying symmetric difference automata have a known tight bound of [Formula: see text] for their state complexity. We now consider the non-unary case and show that, every text], there is regular language accepted by nondeterministic automaton with states, such that its equivalent minimal deterministic finite has states. Furthermore, given any SV-XNFA it possible, up to isomorphism, ...

State minimization plays a fundamental role in both classical automata theory and in the theory of reactive systems. Many algorithms and results are based on the fact that for each nite automaton there exists an equivalent minimum state automaton that can be eeectively computed and that is unique up to isomorphism. Timed safety automata (TSA's) 5], nite automata with clocks, have been used exte...

Here we present a new non-recursive minimal-time solution to the Firing Squad Synchronization Problem which does not use any recursive process. In 1962, E. Goto designed an iterative algorithm which uses Minsky-McCarthy’s solutions to synchronize in minimal-time. Our solution does not use any standard recursion process, only some “fractal computation”, making it a purely iterative synchronizati...

The synchronization problem is investigated for the class of locally strongly transitive automata introduced in [9]. Some extensions of this problem related to the notions of stable set and word of minimal rank of an automaton are studied. An application to synchronizing colorings of aperiodic graphs with a Hamiltonian path is also considered.

We present an algorithm for constructing the minimal automaton recognizing AX, where the pattern X is a set of m (that is a fixed integer) non-empty words over a finite alphabet A whose sum of lengths is n. This algorithm, inspired by Brzozowski’s minimization algorithm, uses sparse lists to achieve a linear time complexity with respect to n.

In this paper we suggest that social robots should not mirror exactly human social behavior (facial expressions, language, etc) but need to be able to produce believable social behaviors that provide a minimal set of actions by which human-companion cooperation can be achieved. For implementing such an ethologically inspired social robot behavior, a platform based on fuzzy automaton (fuzzy stat...

We give a new presentation of two results concerning synchronized automata. The first one gives a linear bound on the synchronization delay of complete local automata. The second one gives a cubic bound for the minimal length of a synchronizing pair in a complete synchronized unambiguous automaton. The proofs are based on results on unambiguous monoids of relations. Mathematics Subject Classifi...

We show that weighted automata over the field of two elements can be exponentially more compact than non-deterministic finite state automata. To this, we combine ideas from theory and communication complexity. However, are also efficiently learnable in Angluin's minimal adequate teacher model a number queries is polynomial size automaton. include an algorithm for learning WAs any based on linea...

Quotient is a basic operation of formal languages, which plays key role in the construction minimal deterministic finite automata (DFA) and universal automata. In this paper, we extend to power series systemically investigate its implications study weighted particular, define two quotient operations for are called (left or right) quotients residuals respectively. Algebraic properties closure (w...