Model checking for probabilistic timed automata

Author： Norman Gethin   Parker David   Sproston Jeremy  

Publisher： Springer Publishing Company

ISSN： 0925-9856

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

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

Dealing with practical limitations of distributed timed model checking for timed automata

By Braberman V.   Olivero A.   Schapachnik F.  

Formal Methods in System Design, Vol. 29, Iss. 2, 2006-09 ,pp. : 197-214

Springer Publishing Company

Access to resources Recommend Favorite

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

Mapping OWL-S Process Model to Timed Automata: A Model-Checking Timed Temporal Logic Oriented Approach

By  

Journal of Information Technology Research (JITR), Vol. 11, Iss. 1, 2018-01 ,pp. : 29-48

IGI Global_journal

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

Numerical vs. statistical probabilistic model checking

By Younes Håkan   Kwiatkowska Marta   Norman Gethin   Parker David  

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

Springer Publishing Company

Access to resources Recommend Favorite