221 search results - page 3 / 45 » From MITL to Timed Automata |
CSL
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
TACAS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Time Petri Nets (TPN) and Timed Automata (TA) are widely-used formalisms for the modeling and analysis of timed systems. A recently-developed approach for the analysis of...
JSS
2006
13 years 7 months ago
2006
APSEC
1995
IEEE
13 years 11 months ago
1995
IEEE
FOSSACS
2011
Springer
12 years 10 months ago
2011
Springer
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...