Sciweavers

13 search results - page 1 / 3
» Decidable Compositions of O-Minimal Automata
Sort
View
ATVA
2008
Springer
148views Hardware» more  ATVA 2008»
13 years 7 months ago
Decidable Compositions of O-Minimal Automata
We identify a new class of decidable hybrid automata: namely, parallel compositions of semi-algebraic o-minimal automata. The class we consider is fundamental to hierarchical model...
Alberto Casagrande, Pietro Corvaja, Carla Piazza, ...
HYBRID
2000
Springer
13 years 9 months ago
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...
Joseph S. Miller
CSL
2006
Springer
13 years 9 months ago
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
Abstract. Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order...
Alexander Moshe Rabinovich, Wolfgang Thomas
SERVICES
2008
130views more  SERVICES 2008»
13 years 6 months ago
Composition of Interactive Web Services Based on Controller Synthesis
an abstract form of service composition where Web services are represented as nondeterministic communicating automata. Considering the case in which communication is done via chan...
Philippe Balbiani, Fahima Cheikh, Guillaume Feuill...
RP
2009
Springer
124views Control Systems» more  RP 2009»
13 years 12 months ago
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...
Denis Lugiez