Sciweavers

33 search results - page 4 / 7
» Reachability Problems on Extended O-Minimal Hybrid Automata
Sort
View
ICALP
1997
Springer
15 years 1 months ago
Discrete-Time Control for Rectangular Hybrid Automata
Rectangular hybrid automatamodel digital control programs of analog plant environments. We study rectangular hybrid automatawhere the plant state evolves continuously in real-numbe...
Thomas A. Henzinger, Peter W. Kopke
CONCUR
2001
Springer
15 years 2 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
LFCS
2007
Springer
15 years 3 months ago
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
Abstract. We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” whic...
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
AAAI
2000
14 years 11 months ago
Preserving Ambiguities in Generation via Automata Intersection
We discuss the problem of generating text that preserves certain ambiguities, a capability that is useful in applications such as machine translation. We show that it is relativel...
Kevin Knight, Irene Langkilde
FOSSACS
2007
Springer
15 years 3 months ago
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
Matthew Hague, C.-H. Luke Ong