Sciweavers

615 search results - page 20 / 123
» High-Level Nondeterministic Abstractions in
Sort
View
ICSEA
2007
IEEE
14 years 4 months ago
Test-Case Generation and Coverage Analysis for Nondeterministic Systems Using Model-Checkers
Abstract—Nondeterminism is used as a means of underspecification or implementation choice in specifications, and it is often necessary if part of a system or the environment is...
Gordon Fraser, Franz Wotawa
CONCUR
2010
Springer
13 years 8 months ago
On the Use of Non-deterministic Automata for Presburger Arithmetic
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...
Antoine Durand-Gasselin, Peter Habermehl
ALP
1997
Springer
14 years 1 months ago
Optimal Non-deterministic Functional Logic Computations
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
Sergio Antoy
TACAS
2001
Springer
92views Algorithms» more  TACAS 2001»
14 years 2 months ago
Language Containment Checking with Nondeterministic BDDs
Abstract. Checking for language containment between nondeterministic ω-automata is a central task in automata-based hierarchical verification. We present a symbolic procedure for...
Bernd Finkbeiner
DLT
2007
13 years 11 months ago
Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP
Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...
Hermann Gruber, Markus Holzer