Sciweavers

512 search results - page 78 / 103
» Automata as Abstractions
Sort
View
FMCO
2006
Springer
128views Formal Methods» more  FMCO 2006»
13 years 11 months ago
Model-Based Test Selection for Infinite-State Reactive Systems
This paper addresses the problem of off-line selection of test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of re...
Bertrand Jeannet, Thierry Jéron, Vlad Rusu
CSR
2008
Springer
13 years 9 months ago
The Most General Conservation Law for a Cellular Automaton
Abstract. We study the group-valued and semigroup-valued conservation laws in cellular automata (CA). We provide examples to distinguish between semigroup-valued, group-valued and ...
Enrico Formenti, Jarkko Kari, Siamak Taati
CAI
2007
Springer
14 years 1 months ago
Learning Deterministically Recognizable Tree Series - Revisited
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
Andreas Maletti
LATA
2010
Springer
14 years 4 months ago
Untestable Properties Expressible with Four First-Order Quantifiers
Abstract. In property testing, the goal is to distinguish between structures that have some desired property and those that are far from having the property, after examining only a...
Charles Jordan and Thomas Zeugmann
LATA
2010
Springer
14 years 2 months ago
Using Sums-of-Products for Non-standard Reasoning
Abstract. An important portion of the current research in Description Logics is devoted to the expansion of the reasoning services and the developement of algorithms that can adequ...
Rafael Peñaloza