Results 11 to 20 of about 18,671,098 (47)
Testing conformance of a deterministic implementation against a non-deterministic stream X-machine [PDF]
, 2004 Stream X-machines are a formalisation of extended finite state machines that have been used to specify systems. One of the great benefits of using stream X-machines, for the purpose of specification, is the associated test generation technique which ...
Harman, M, Hierons, RM
core +7 more sources
Algebraic Methods for Finite Linear Cellular Automata [PDF]
, 1996 PhDCellular automata are a simple class of extended dynamical systems which have been much studied in recent years. Linear cellular automata are the class of cellular automata most amenable to algebraic analytic treatments, algebraic techniques are ...
Dow, R. A.
core +4 more sources
Testing a deterministic implementation against a non-controllable non-deterministic stream X-machine [PDF]
, 2008 A stream X-machine is a type of extended finite state machine with an associated development approach that consists of building a system from a set of trusted components.
Ipate, F, Hierons, RM
core +6 more sources
Automated test sequence generation for finite state machines using genetic algorithms [PDF]
, 2006 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Testing software implementations, formally specified using finite state automata (FSA) has been of interest.
Derderian, Karnig Agop
core +7 more sources
On Semantically-Deterministic Automata [PDF]
, 2023 Nondeterminism is a fundamental notion in Theoretical Computer Science. A nondeterministic automaton is semantically deterministic (SD) if different nondeterministic choices in the automaton lead to equivalent states.
Abu Radi, Bader, Kupferman, Orna
core +1 more source
Mutation testing from probabilistic finite state machines [PDF]
, 2007 Mutation testing traditionally involves mutating a program in order to produce a set of mutants and using these mutants in order to either estimate the effectiveness of a test suite or to drive test generation.
Robert M. Hierons +3 more
core +1 more source
, 2011 What is a basic automata-theoretic model of computation with names and fresh-name generation? We introduce Fresh-Register Automata (FRA), a new class of automata which operate on an infinite alphabet of names and use a finite number of registers to store
Tzevelekos, N, Nikos Tzevelekos
core +1 more source
Minimizing finite automata is computationally hard [PDF]
, 2002 It is known that deterministic finite automata (DFAs) can be algorithmically minimized, i.e., a DFA M can be converted to an equivalent DFA M' which has a minimal number of states. The minimization can be done efficiently [6].
Malcher, Andreas
core
Efficient Multistriding of Large Non-deterministic Finite State Automata for Deep Packet Inspection [PDF]
, 2012 Multistride automata speed up input matching because each multistriding transformation halves the size of the input string, leading to a potential 2x speedup.
Sisto, Riccardo +5 more
core +1 more source
Achievable Bisimilar Behaviour of Abstract State Systems [PDF]
, 2005 Given a plant system and a desired system, we study conditions for which there exists a controller that interconnected with the plant, yields a system that is bisimilar to the desired system.
M.D. Di Benedetto +12 more
core +2 more sources