Sciweavers

1246 search results - page 7 / 250
» Recursive Timed Automata
Sort
View
HYBRID
1997
Springer
13 years 11 months ago
Robust Timed Automata
We de ne robust timed automata, which are timed automata that accept all trajectories \robustly": if a robust timed automaton accepts a trajectory, then it must accept neighbo...
Vineet Gupta, Thomas A. Henzinger, Radha Jagadeesa...
FORMATS
2004
Springer
14 years 23 days ago
Model-Checking for Weighted Timed Automata
We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with co...
Thomas Brihaye, Véronique Bruyère, J...
IJCSA
2007
84views more  IJCSA 2007»
13 years 7 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»
13 years 5 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