Sciweavers

8 search results - page 2 / 2
» Cut sets as recognizable tree languages
Sort
View
ICALP
2010
Springer
13 years 10 months ago
A Topological Approach to Recognition
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
Mai Gehrke, Serge Grigorieff, Jean-Eric Pin
ECAI
1998
Springer
13 years 10 months ago
Metaprogramming Forced Moves
Knowledge about forced moves enables to select a small number of moves from the set of possible moves. It is very important in complex domains where search trees have a large branc...
Tristan Cazenave
HASE
2007
IEEE
14 years 2 days ago
Integrating Product-Line Fault Tree Analysis into AADL Models
Fault Tree Analysis (FTA) is a safety-analysis technique that has been recently extended to accommodate product-line engineering for critical domains. This paper describes a tool-...
Hongyu Sun, Miriam Hauptman, Robyn R. Lutz