2632 search results - page 11 / 527 » Alternating Timed Automata |
ISTCS
1997
Springer
15 years 3 months ago
1997
Springer
CORR
2008
Springer
14 years 12 months ago
2008
Springer
CORR
2008
Springer
14 years 12 months ago
2008
Springer
IJCSA
2007
14 years 11 months ago
2007
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...
JUCS
2010
14 years 10 months ago
2010
: The membership problems of both stack automata and nonerasing stack automata are shown to be complete for polynomial time.