Lower and upper bounds in zone-based abstractions of timed automata

By Behrmann Gerd   Bouyer Patricia   Larsen Kim   Pelánek Radek  

International Journal on Software Tools for Technology Transfer, Vol. 8, Iss. 3, 2006-06 ,pp. : 204-215

Springer Publishing Company

Access to resources Recommend Favorite

Timed verification of the generic architecture of a memory circuit using parametric timed automata

By Chevallier Remy   Encrenaz-Tiphene Emmanuelle   Fribourg Laurent   Xu Weiwen  

Formal Methods in System Design, Vol. 34, Iss. 1, 2009-02 ,pp. : 59-81

Springer Publishing Company

Access to resources Recommend Favorite

Intractability of decision problems for finite-memory automata

By Sakamoto H.   Ikeda D.  

Theoretical Computer Science, Vol. 231, Iss. 2, 2000-01 ,pp. : 297-308

Elsevier

Access to resources Recommend Favorite

-transitions in Concurrent Timed Automata

By Lanotte R.   Maggiolo-Schettini A.   Tini S.  

Information Processing Letters, Vol. 89, Iss. 1, 2004-01 ,pp. : 1-7

Elsevier

Access to resources Recommend Favorite

Finite automata on timed -trees

By La Torre S.   Napoli M.  

Theoretical Computer Science, Vol. 293, Iss. 3, 2003-02 ,pp. : 479-505

Elsevier

Access to resources Recommend Favorite