An extension of the inverse method to probabilistic timed automata

ISSN： 0925-9856

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

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

On probabilistic timed automata

By Beauquier D.

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

Elsevier

Access to resources Recommend Favorite

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

SetExp : a method of transformation of timed automata into finite state automata

By Ouedraogo Lucien

Real-Time Systems, Vol. 46, Iss. 2, 2010-10 ,pp. : 189-250

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