A decomposition theorem for probabilistic transition systems

Author： D. Perrin   Maler O.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.145, Iss.1, 1995-07, pp. : 391-396

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 decomposition theorem for finite persistent transition systems

By Best Eike  

Acta Informatica, Vol. 46, Iss. 3, 2009-05 ,pp. : 237-254

Springer Publishing Company

Access to resources Recommend Favorite

Bisimulation for probabilistic transition systems: a coalgebraic approach

By de Vink E.P.   Rutten J.J.M.M.  

Theoretical Computer Science, Vol. 221, Iss. 1, 1999-06 ,pp. : 271-293

Elsevier

Access to resources Recommend Favorite

Multi-level decomposition of probabilistic relations

By Grygiel Stanislaw   Zwick Martin   Perkowski Marek  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 33, Iss. 5-6, 2004-05 ,pp. : 948-961

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Deciding probabilistic bisimilarity over infinite-state probabilistic systems

By Brázdil Tomáš   Kučera Antonín   Stražovský Oldřich  

Acta Informatica, Vol. 45, Iss. 2, 2008-04 ,pp. : 131-154

Springer Publishing Company

Access to resources Recommend Favorite

The decomposition method applied to differential systems

By Abbaoui K   Cherruault Y   Ndour M  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 24, Iss. 8, 1995-08 ,pp. : 32-40

Emerald Group Publishing Ltd

Access to resources Recommend Favorite