Proving sequential function chart programs using timed automata

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.267, Iss.1, 2001-09, pp. : 141-155

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

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

-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

Concurrency in timed automata

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

Theoretical Computer Science, Vol. 309, Iss. 1, 2003-12 ,pp. : 503-527

Elsevier

Access to resources Recommend Favorite

Timed automata with urgent transitions

By Barbuti Roberto Tesei Luca

Acta Informatica, Vol. 40, Iss. 5, 2004-03 ,pp. : 317-347

Springer Publishing Company

Access to resources Recommend Favorite