Hardness of equivalence checking for composed finite-state systems

ISSN： 0001-5903

Source： Acta Informatica, Vol.46, Iss.3, 2009-05, pp. : 169-191

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 polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems

By DasGupta

Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. : 161-189

Elsevier

Access to resources Recommend Favorite

Fixed point characterization of infinite behavior of finite-state systems

By Niwinski D.

Theoretical Computer Science, Vol. 189, Iss. 1, 1997-12 ,pp. : 1-69

Elsevier

Access to resources Recommend Favorite

Exploiting transition locality in automatic verification of finite-state concurrent systems

By Della Penna Giuseppe Intrigila Benedetto Melatti Igor Tronci Enrico Venturini Zilli Marisa

International Journal on Software Tools for Technology Transfer, Vol. 6, Iss. 4, 2004-08 ,pp. : 320-341

Springer Publishing Company

Access to resources Recommend Favorite

Finite-State Self-Stabilizing Protocols in Message-Passing Systems

By Howell R.R. Nesterenko M. Mizuno M.

Journal of Parallel and Distributed Computing, Vol. 62, Iss. 5, 2002-05 ,pp. : 792-817

Academic Press

Access to resources Recommend Favorite

ROUGH FINITE-STATE AUTOMATA

By BASU SUMITA

Cybernetics and Systems, Vol. 36, Iss. 2, 2005-03 ,pp. : 107-124

Taylor & Francis Ltd

Access to resources Recommend Favorite