Sciweavers

1355 search results - page 1 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
LICS
2010
IEEE
13 years 4 months ago
Alternating Timed Automata over Bounded Time
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
Mark Jenkins, Joël Ouaknine, Alexander Rabino...
CORR
2011
Springer
147views Education» more  CORR 2011»
13 years 1 months ago
On Reachability for Hybrid Automata over Bounded Time
This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target locat...
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, J...
IFIPTCS
2000
13 years 10 months ago
Real-Time Language Recognition by Alternating Cellular Automata
The capabilities of alternating cellular automata (ACA) to accept formal languages are investigated. Several notions of alternation in cellular automata have been proposed. Here we...
Thomas Buchholz, Andreas Klein, Martin Kutrib
HYBRID
1998
Springer
13 years 10 months ago
Equations on Timed Languages
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we intr...
Eugene Asarin
TACAS
2010
Springer
342views Algorithms» more  TACAS 2010»
14 years 1 months ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Janusz Malinowski, Peter Niebert