Sciweavers

942 search results - page 37 / 189
» Interrupt Timed Automata
Sort
View
ICALP
2009
Springer
14 years 9 months ago
Weak Alternating Timed Automata
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
Pawel Parys, Igor Walukiewicz
ENTCS
2007
156views more  ENTCS 2007»
13 years 8 months ago
Bounded Model Checking with Parametric Data Structures
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
Erika Ábrahám, Marc Herbstritt, Bern...
HYBRID
1995
Springer
14 years 10 days ago
Interconnected Automata and Linear Systems: A Theoretical Framework in Discrete-Time
This paper summarizes the definitions and several of the main results of an approach to hybrid systems, which combines finite automata and linear systems, developed by the author...
Eduardo D. Sontag
AAAI
2004
13 years 10 months ago
GROWRANGE: Anytime VCG-Based Mechanisms
We introduce anytime mechanisms for distributed optimization with self-interested agents. Anytime mechanisms retain good incentive properties even when interrupted before the opti...
David C. Parkes, Grant Schoenebeck
FORMATS
2006
Springer
14 years 14 days ago
On Timed Simulation Relations for Hybrid Systems and Compositionality
Timed and weak timed simulation relations are often used to show that operations on hybrid systems result in equivalent behavior or in conservative overapproximations. Given that s...
Goran Frehse