Sciweavers

1705 search results - page 24 / 341
» Representing Constraints with Automata
Sort
View
ATVA
2011
Springer
213views Hardware» more  ATVA 2011»
12 years 7 months ago
Max and Sum Semantics for Alternating Weighted Automata
Abstract. In the traditional Boolean setting of formal verification, alternating automata are the key to many algorithms and tools. In this setting, the correspondence between dis...
Shaull Almagor, Orna Kupferman
AAAI
2006
13 years 9 months ago
DNNF-based Belief State Estimation
As embedded systems grow increasingly complex, there is a pressing need for diagnosing and monitoring capabilities that estimate the system state robustly. This paper is based on ...
Paul Elliott, Brian C. Williams
IJFCS
2007
63views more  IJFCS 2007»
13 years 7 months ago
Path-Equivalent Developments in Acyclic Weighted Automata
Weighted finite automata (WFA) are used with FPGA accelerating hardware to scan large genomic banks. Hardwiring such automata raises surface area and clock frequency constraints,...
Mathieu Giraud, Philippe Veber, Dominique Lavenier
LICS
2008
IEEE
14 years 2 months ago
Winning Regions of Higher-Order Pushdown Games
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H...
HYBRID
2005
Springer
14 years 1 months ago
The Discrete Time Behavior of Lazy Linear Hybrid Automata
We study the class of lazy linear hybrid automata with finite precision. The key features of this class are: – The observation of the continuous state and the rate changes assoc...
Manindra Agrawal, P. S. Thiagarajan