Sciweavers

181 search results - page 9 / 37
» Testable Use Cases in the Abstract State Machine Language
Sort
View
ICGI
2004
Springer
15 years 3 months ago
Learning Stochastic Finite Automata
Abstract. Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of th...
Colin de la Higuera, José Oncina
ACL
1997
14 years 11 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
MODELS
2007
Springer
15 years 3 months ago
Piecewise Modelling with State Subtypes
Abstract. Models addressing both structure and behaviour of a system are usually quite complex. Much of the complexity is caused by the necessity to distinguish between different c...
Friedrich Steimann, Thomas Kühne
GC
2004
Springer
15 years 3 months ago
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
Johannes Borgström, Uwe Nestmann, Luc Onana A...
PTS
2000
58views Hardware» more  PTS 2000»
14 years 11 months ago
Formal Test Automation: The Conference Protocol with PHACT
We discuss a case study of automatic test generation and test execution based on formal methods. The case is the Conference Protocol, a simple, chatbox-like protocol, for which (fo...
Lex Heerink, Jan Feenstra, Jan Tretmans