481 search results - page 23 / 97 » Model Checking Abstract State Machines and Beyond |
FMSD
1998
15 years 1 months ago
1998
Proving the equivalenceof two Finite State Machines (FSMs) has many applications to synthesis, veri cation, testing, and diagnosis. Building their product machine is a theoretical ...
111
click to vote
KBSE
2002
IEEE
15 years 6 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,...
111
click to vote
ACL
2010
14 years 12 months ago
2010
In recent years, research in natural language processing has increasingly focused on normalizing SMS messages. Different well-defined approaches have been proposed, but the proble...
115
click to vote
PAAPP
2007
15 years 1 months ago
2007
The quantum model of computation not only o ers entirely new ways to manipulate information, but also allows information processing tasks to be formulated in unconventional, genui...
121
click to vote
AAAI
2008
15 years 4 months ago
2008
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...