Probabilistic and prioritized models of timed CSP

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.138, Iss.2, 1995-02, pp. : 315-352

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

A brief history of Timed CSP

By Davies J. Schneider S.

Theoretical Computer Science, Vol. 138, Iss. 2, 1995-02 ,pp. : 243-271

Elsevier

Access to resources Recommend Favorite

The timed failures - Stability model for CSP

By Reed G.M. Roscoe A.W.

Theoretical Computer Science, Vol. 211, Iss. 1, 1999-01 ,pp. : 85-127

Elsevier

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

An approach for machine-assisted verification of Timed CSP specifications

By Göthel Thomas

Innovations in Systems and Software Engineering, Vol. 6, Iss. 3, 2010-09 ,pp. : 181-193

Springer Publishing Company

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