Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

ICALP
2009
Springer

favoriteEmaildiscussreport

126views Programming Languages» more ICALP 2009»

Weak Alternating Timed Automata

14 years 4 months ago

Weak Alternating Timed Automata

Download www.labri.fr

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 decidable. This result implies new decidability results for fragments of timed temporal logics. It is also shown that, unlike for MITL, the characterisation remains the same even if no punctual constraints are allowed.

Pawel Parys, Igor Walukiewicz

Real-time Traffic

ICALP 2009 | Punctual Constraints | Theoretical Computer Science | Timed Temporal Logics |

claim paper

Related Content

» Efficient onthefly Algorithm for Checking Alternating Timed Simulation

» Weak Alternating Automata Are Not That Weak

» Weak Alternating Automata and Tree Automata Emptiness

» Weak bisimulation for Probabilistic Timed Automata

» Alternating Timed Automata over Bounded Time

» When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets

» On the Topological Complexity of Weakly Recognizable Tree Languages

» Universality and Language Inclusion for Open and Closed Timed Automata

» Comparative Analysis of Bisimulation Relations on Alternating and NonAlternating Probabili...

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2009
Where	ICALP
Authors	Pawel Parys, Igor Walukiewicz

Comments (0)