Sciweavers

93 search results - page 1 / 19
» Weak Alternating Timed Automata
Sort
View
ICALP
2009
Springer
14 years 5 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
FORMATS
2009
Springer
13 years 9 months ago
Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation
Abstract In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. We define timed weak ...
Peter Bulychev, Thomas Chatain, Alexandre David, K...
ISTCS
1997
Springer
13 years 9 months ago
Weak Alternating Automata Are Not That Weak
Orna Kupferman, Moshe Y. Vardi
STOC
1998
ACM
115views Algorithms» more  STOC 1998»
13 years 9 months ago
Weak Alternating Automata and Tree Automata Emptiness
Orna Kupferman, Moshe Y. Vardi
TCS
2010
12 years 11 months ago
Weak bisimulation for Probabilistic Timed Automata
We are interested in describing timed systems that exhibit probabilistic behaviour. To this purpose, we consider a model of Probabilistic Timed Automata and introduce a concept of ...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...