Sciweavers

2632 search results - page 11 / 527
» Alternating Timed Automata
Sort
View
ISTCS
1997
Springer
15 years 1 months ago
Weak Alternating Automata Are Not That Weak
Orna Kupferman, Moshe Y. Vardi
CORR
2008
Springer
69views Education» more  CORR 2008»
14 years 9 months ago
Safety alternating automata on data words
Ranko Lazic
CORR
2008
Springer
76views Education» more  CORR 2008»
14 years 9 months ago
Alternating Automata on Data Trees and XPath Satisfiability
Marcin Jurdzinski, Ranko Lazic
IJCSA
2007
84views more  IJCSA 2007»
14 years 9 months ago
Real Time Model Checking Using Timed Concurrent State Machines
Timed Concurrent State Machines are an application of Alur’s Timed Automata concept to coincidence-based (rather than interleaving) CSM modeling technique. TCSM support the idea...
Wiktor B. Daszczuk
JUCS
2010
112views more  JUCS 2010»
14 years 8 months ago
A Note on the P-completeness of Deterministic One-way Stack Language
: The membership problems of both stack automata and nonerasing stack automata are shown to be complete for polynomial time.
Klaus-Jörn Lange