Sciweavers

732 search results - page 28 / 147
» Axiomatising timed automata
Sort
View
ICALP
2009
Springer
14 years 7 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 7 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
13 years 11 months 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
FM
2009
Springer
146views Formal Methods» more  FM 2009»
13 years 5 months ago
Verifying Real-Time Systems against Scenario-Based Requirements
Abstract. We propose an approach to automatic verification of realtime systems against scenario-based requirements. A real-time system is modeled as a network of Timed Automata (TA...
Kim Guldstrand Larsen, Shuhao Li, Brian Nielsen, S...
FORMATS
2006
Springer
13 years 11 months 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