Results 21 to 30 of about 18,671,098 (47)
Mutation testing from probabilistic and stochastic finite state machines [PDF]
, 2009 Specification mutation involves mutating a specification, and for each mutation a test is derived that distinguishes the behaviours of the mutated and original specifications. This approach has been applied with finite state machine based models.
García Merayo, María De Las Mercedes +3 more
core +1 more source
1 Finite-State Automata: Characterization Finite-State Acceptors [PDF]
, 2012 Definition (Non-deterministic finite-state acceptor (NFA)) A non-deterministic finite-state acceptor A is a 5-tuple (Q, Σ, q0, F, δ) where Q is a finite set of states Σ is the alphabet q0 ∈ Q is the start state F ⊆ Q is a set of final states δ: Q × Σ ...
Nina Seemann, Finite-state Transducers
core
Testing from a nondeterministic finite state machine using adaptive state counting [PDF]
, 2004 The problem of generating a checking experiment from a nondeterministic finite state machine has been represented in terms of state counting. However, test techniques that use state counting traditionally produce preset test suites.
Hierons, RM
core +1 more source
Decision procedures for families of deterministic pushdown automata [PDF]
The existence and complexity of decision procedures for families of deterministic pushdown automata are investigated, with special emphasis on positive decidability results for those questions, such as equivalence, which are known to become ...
Valiant, Leslie
core
Amorphous slicing of extended finite state machines [PDF]
, 2013 Slicing is useful for many Software Engineering applications and has been widely studied for three decades, but there has been comparatively little work on slicing Extended Finite State Machines (EFSMs).
Clark, David +17 more
core +1 more source
Model checking of continuous-time Markov Chains against timed automata specifications [PDF]
, 2011 We study the verification of a finite continuous-time Markov chain (CTMC) C against a linear real-time specification given as a deterministic timed automaton (DTA) A with finite or Muller acceptance conditions.
Jagadeesan, R. +14 more
core +3 more sources
Controllable testing from nondeterministic finite state machines with multiple ports [PDF]
, 2011 Copyright @ 2011 IEEESome systems have physically distributed interfaces, called ports, at which they interact with their environment. We place a tester at each port and if the testers cannot directly communicate and there is no global clock then we are ...
Rob Hierons, Hierons, RM
core +1 more source
Non-Deterministic Finite Cover Automata [PDF]
, 2015 The concept of Deterministic Finite Cover Automata (DFCA) was introduced at WIA ’98, as a more compact representation than Deterministic Finite Automata (DFA) for finite languages.
C. Câmpeanu
core +2 more sources
Verdict functions in testing with a fault domain or test hypotheses [PDF]
, 2008 In state based testing it is common to include verdicts within test cases, the result of the test case being the verdict reached by the test run. In addition, approaches that reason about test effectiveness or produce tests that are guaranteed to find ...
Hierons, RM
core +3 more sources
DAFSA: a Python Library for Deterministic Acyclic Finite State Automata
, 2020 Python library for computing Deterministic Acyclic Finite State Automata (DAFSA)
Tiago Tresoldi
core +1 more source