Sciweavers

493 search results - page 65 / 99
» Alternating Weighted Automata
Sort
View
COLING
1992
13 years 8 months ago
Compiling and Using Finite-State Syntactic Rules
A language-independent framework for syntactic finlte-state parsing is discussed. The article presents a framework, a formalism, a compiler and a parser for grammars written in th...
Kimmo Koskenniemi, Pasi Tapanainen, Atro Voutilain...
JAIR
2006
110views more  JAIR 2006»
13 years 7 months ago
Modelling Mixed Discrete-Continuous Domains for Planning
In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl...
Maria Fox, Derek Long
ICGI
2010
Springer
13 years 5 months ago
Exact DFA Identification Using SAT Solvers
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
Marijn J. H. Heule, Sicco Verwer
SEKE
2010
Springer
13 years 5 months ago
Specification patterns can be formal and still easy
Abstract--Property specification is still one of the most challenging tasks for transference of software verification technology like model checking. The use of patterns has been p...
Fernando Asteasuain, Víctor A. Braberman
FORTE
2009
13 years 5 months ago
Keep It Small, Keep It Real: Efficient Run-Time Verification of Web Service Compositions
Abstract. Service compositions leverage remote services to deliver addedvalue distributed applications. Since services are administered and run by independent parties, the governan...
Luciano Baresi, Domenico Bianculli, Sam Guinea, Pa...