206 search results - page 6 / 42 » Probabilistic Analysis of Large Finite State Machines |
86
Voted
COLT
1995
Springer
15 years 1 months ago
1995
Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper explores the issue of recognizing, generalizing and reproducing arbitrary gestures. We aim at extracting a representation that encapsulates only the key aspects of the ...
TACAS
1998
Springer
15 years 1 months ago
1998
Springer
A state/event model is a concurrent version of Mealy machines used for describing embedded reactive systems. This paper introduces a technique that uses compositionality and depend...
CONCUR
2000
Springer
15 years 1 months ago
2000
Springer
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
KBSE
2002
IEEE
15 years 2 months ago
2002
IEEE
Finite-state machine (FSM) models are commonly used to represent software with concurrent processes. Established model checking tools can be used to automatically test FSM models,...