On probabilistic timed automata

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.292, Iss.1, 2003-01, pp. : 65-84

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

Model checking for probabilistic timed automata

By Norman Gethin Parker David Sproston Jeremy

Formal Methods in System Design, Vol. 43, Iss. 2, 2013-10 ,pp. : 164-190

Springer Publishing Company

Access to resources Recommend Favorite

An extension of the inverse method to probabilistic timed automata

By André Étienne

Formal Methods in System Design, Vol. 42, Iss. 2, 2013-04 ,pp. : 119-145

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